A370818 -id:A370818 - cp's OEIS frontend

A370638 Number of subsets of {1..n} such that a unique set can be obtained by choosing a different binary index of each element.

1, 2, 4, 6, 12, 19, 30, 45, 90, 147, 230, 343, 504, 716, 994, 1352, 2704, 4349, 6469, 9162, 12585, 16862, 22122, 28617, 36653, 46431, 58075, 72097, 88456, 107966, 130742, 157647, 315294, 494967, 704753, 950080, 1234301, 1565165, 1945681, 2387060, 2890368, 3470798

Offset: 0

Gus Wiseman, Mar 09 2024

nonn

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.

			The set {3,4} has binary indices {{1,2},{3}}, with two choices {1,3}, {2,3}, so is not counted under a(4).
The a(0) = 1 through a(5) = 19 subsets:
  {}  {}   {}     {}     {}       {}
      {1}  {1}    {1}    {1}      {1}
           {2}    {2}    {2}      {2}
           {1,2}  {1,2}  {4}      {4}
                  {1,3}  {1,2}    {1,2}
                  {2,3}  {1,3}    {1,3}
                         {1,4}    {1,4}
                         {2,3}    {1,5}
                         {2,4}    {2,3}
                         {1,2,4}  {2,4}
                         {1,3,4}  {4,5}
                         {2,3,4}  {1,2,4}
                                  {1,2,5}
                                  {1,3,4}
                                  {1,3,5}
                                  {2,3,4}
                                  {2,3,5}
                                  {2,4,5}
                                  {3,4,5}

Wikipedia, Axiom of choice.

Set systems of this type are counted by A367904, ranks A367908.
A version for MM-numbers of multisets is A368101.
For prime indices we have A370584.
This is the unique version of A370636, complement A370637.
The maximal case is A370640, differences A370641.
Factorizations of this type are counted by A370645.
The case A370818 is the restriction to A000225.
A048793 lists binary indices, A000120 length, A272020 reverse, A029931 sum.
A058891 counts set-systems, A003465 covering, A323818 connected.
A070939 gives length of binary expansion.
A096111 gives product of binary indices.
Cf. A133686, A134964, A326031, A326702, A367772, A367867, A367905, A367909, A367912, A368109.

bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
Table[Length[Select[Subsets[Range[n]],Length[Union[Sort /@ Select[Tuples[bpe/@#],UnsameQ@@#&]]]==1&]],{n,0,10}]

a(2^n - 1) = A370818(n).

More terms from Jinyuan Wang, Mar 28 2025

A370646 Number of non-isomorphic multiset partitions of weight n such that only one set can be obtained by choosing a different element of each block.

Original entry on oeis.org

1, 1, 2, 4, 10, 23, 62, 165, 475, 1400, 4334

Offset: 0

Gus Wiseman, Mar 12 2024

A multiset partition is a finite multiset of finite nonempty multisets. The weight of a multiset partition is the sum of cardinalities of its elements.

			The multiset partition {{3},{1,3},{2,3}} has unique choice (3,1,2) so is counted under a(5).
Representatives of the a(1) = 1 through a(5) = 23 multiset partitions:
  {1}  {11}    {111}      {1111}        {11111}
       {1}{2}  {1}{22}    {1}{122}      {11}{122}
               {2}{12}    {11}{22}      {1}{1222}
               {1}{2}{3}  {12}{12}      {11}{222}
                          {1}{222}      {12}{122}
                          {12}{22}      {1}{2222}
                          {2}{122}      {12}{222}
                          {1}{2}{33}    {2}{1122}
                          {1}{3}{23}    {2}{1222}
                          {1}{2}{3}{4}  {22}{122}
                                        {1}{2}{233}
                                        {1}{22}{33}
                                        {1}{23}{23}
                                        {1}{2}{333}
                                        {1}{23}{33}
                                        {1}{3}{233}
                                        {2}{12}{33}
                                        {2}{13}{23}
                                        {2}{3}{123}
                                        {3}{13}{23}
                                        {1}{2}{3}{44}
                                        {1}{2}{4}{34}
                                        {1}{2}{3}{4}{5}

For existence we have A368098, complement A368097.
Multisets of this type are ranked by A368101, see also A368100, A355529.
Subsets of this type are counted by A370584, see also A370582, A370583.
Maximal sets of this type are counted by A370585.
Partitions of this type are counted by A370594, see also A370592, A370593.
Subsets of this type are also counted by A370638, see also A370636, A370637.
Factorizations of this type are A370645, see also A368414, A368413.
Set-systems of this type are A370818, see also A367902, A367903.
A000110 counts set partitions, non-isomorphic A000041.
A001055 counts factorizations, strict A045778.
A007716 counts non-isomorphic multiset partitions, connected A007718.
Cf. A000612, A055621, A283877, A300913, A302545, A316983, A319616, A330223, A368095, A368412, A368422.

cp's OEIS Frontend

A370638 Number of subsets of {1..n} such that a unique set can be obtained by choosing a different binary index of each element.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions