|
|
A370641
|
|
Number of maximal subsets of {1..n} containing n such that it is possible to choose a different binary index of each element.
|
|
8
|
|
|
0, 1, 1, 2, 3, 5, 9, 15, 32, 45, 67, 98, 141, 197, 263, 358, 1201, 1493, 1920, 2482, 3123, 3967, 4884, 6137, 7584, 9369
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
COMMENTS
|
A binary index of n is any position of a 1 in its reversed binary expansion. The binary indices of n are row n of A048793.
Also choices of A029837(n) elements of {1..n} containing n such that it is possible to choose a different binary index of each.
|
|
LINKS
|
|
|
EXAMPLE
|
The a(0) = 0 through a(7) = 15 subsets:
. {1} {1,2} {1,3} {1,2,4} {1,2,5} {1,2,6} {1,2,7}
{2,3} {1,3,4} {1,3,5} {1,3,6} {1,3,7}
{2,3,4} {2,3,5} {1,4,6} {1,4,7}
{2,4,5} {1,5,6} {1,5,7}
{3,4,5} {2,3,6} {1,6,7}
{2,5,6} {2,3,7}
{3,4,6} {2,4,7}
{3,5,6} {2,5,7}
{4,5,6} {2,6,7}
{3,4,7}
{3,5,7}
{3,6,7}
{4,5,7}
{4,6,7}
{5,6,7}
|
|
MATHEMATICA
|
bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n, 2]], 1];
Table[Length[Select[Subsets[Range[n], {IntegerLength[n, 2]}], MemberQ[#, n] && Length[Union[Sort/@Select[Tuples[bpe/@#], UnsameQ@@#&]]]>0&]], {n, 0, 25}]
|
|
CROSSREFS
|
A version for set-systems is A368601.
Without requiring n we have A370640.
A070939 gives length of binary expansion.
A096111 gives product of binary indices.
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|