Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
proposed
approved
editing
proposed
Each term k, doubled, can be put into a one-to-one correspondence with a maximal Schreier set (a subset of the positive integers with cardinality equal to the minimum element in the set) by interpreting the 1-based position of the ones in the binary expansion of 2*k (where position 1 corresponds to the least significant bit) as the elements of the corresponding maximal Schreier set. See A373556 for more information. Cf. also A371176. - Paolo Xausa, Jun 13 2024
proposed
editing
editing
proposed
editing
proposed
Each term k, doubled, can be put into a one-to-one correspondence with a maximal Schreier set (a subset of the positive integers with cardinality equal to the minimum element in the set) by interpreting the 1-based position of the ones in the binary expansion of 2*k (where position 1 corresponds to the least significant bit) as the elements of the corresponding maximal Schreier set. See A373556 for more information. - Paolo Xausa, Jun 13 2024
approved
editing
proposed
approved
editing
proposed
Mikhail Kurkov, Jul 04 2022 [verification needed]
approved
editing