A327041 -id:A327041 - cp's OEIS frontend

A327104 Maximum vertex-degree of the set-system with BII-number n.

0, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 2, 2, 2, 1, 2, 1, 2, 2, 3, 2, 3, 2, 2, 2, 2, 2, 3, 2, 3, 1, 1, 2, 2, 2, 2, 3, 3, 2, 2, 2, 2, 2, 2, 3, 3, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 2, 2, 2, 2, 3, 3, 3, 2, 2, 2, 2, 2, 3, 3, 3, 2, 3, 2, 3, 3, 4, 3

Offset: 0

Gus Wiseman, Aug 26 2019

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. We define the set-system with BII-number n to be obtained by taking the binary indices of each binary index of n. Every set-system (finite set of finite nonempty sets) has a different BII-number. For example, 18 has reversed binary expansion (0,1,0,0,1), and since the binary indices of 2 and 5 are {2} and {1,3} respectively, the BII-number of {{2},{1,3}} is 18. Elements of a set-system are sometimes called edges.

In a set-system, the degree of a vertex is the number of edges containing it.

			The BII-number of {{2},{3},{1,2},{1,3},{2,3}} is 62, and its degrees are (2,3,3), so a(62) = 3.

Positions of 1's are A326701 (BII-numbers of set-partitions).
The minimum vertex-degree is A327103.
Positions of 2's are A327106.
Cf. A000120, A048793, A058891, A070939, A326031, A326701, A326786, A327041.

bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
Table[If[n==0,0,Max@@Length/@Split[Sort[Join@@bpe/@bpe[n]]]],{n,0,100}]

A261283 a(n) = bitwise XOR of all the bit numbers for the bits that are set in n, using number 1 for the LSB.

Original entry on oeis.org

0, 1, 2, 3, 3, 2, 1, 0, 4, 5, 6, 7, 7, 6, 5, 4, 5, 4, 7, 6, 6, 7, 4, 5, 1, 0, 3, 2, 2, 3, 0, 1, 6, 7, 4, 5, 5, 4, 7, 6, 2, 3, 0, 1, 1, 0, 3, 2, 3, 2, 1, 0, 0, 1, 2, 3, 7, 6, 5, 4, 4, 5, 6, 7, 7, 6, 5, 4, 4, 5, 6, 7, 3, 2, 1, 0, 0, 1, 2, 3, 2, 3, 0, 1, 1, 0

Offset: 0

M. F. Hasler, Aug 14 2015, following the original version A253315 by Philippe Beaudoin, Dec 30 2014

If the least significant bit is numbered 0, then a(2n) = a(2n+1) if one uses the "natural" definition reading "...set in n": see A253315 for that version. To avoid the duplication, we chose here to start numbering the bits with 1 for the LSB; equivalently, we can start numbering the bits with 0 but use the definition "...bits set in 2n". In any case, a(n) = A253315(2n) = A253315(2n+1).

Since the XOR operation is associative, one can define XOR of an arbitrary number of terms in a recursive way, there is no ambiguity about the order in which the operations are performed.

			a(7) = a(4+2+1) = a(2^2+2^1+2^0) = (2+1) XOR (1+1) XOR (0+1) = 3 XOR 3 = 0.
a(12) = a(8+4) = a(2^3+2^2) = (3+1) XOR (2+1) = 4+3 = 7.

Philippe Beaudoin, Table of n, a(n) for n = 0..8190
Oliver Nash, Yet another prisoner puzzle, coins on a chessboard problem.
Tilman Piesk, Illustration of the first 128 terms

Cf. A075926 (indices of 0's), A253315, A327041 (OR equivalent).

A261283[n_] := If[n == 0, 0, BitXor @@ PositionIndex[Reverse[IntegerDigits[n, 2]]][1]]; Array[A261283, 100, 0] (* Paolo Xausa, May 29 2024 *)

A261283(n,b=bittest(n,0))={for(i=1,#binary(n),bittest(n,i)&&b=bitxor(b,i+1));b}

A326854 BII-numbers of T_0 (costrict), pairwise intersecting set-systems where every two vertices appear together in some edge (cointersecting).

Original entry on oeis.org

0, 1, 2, 5, 6, 8, 17, 24, 34, 40, 52, 69, 70, 81, 84, 85, 88, 98, 100, 102, 104, 112, 116, 120, 128, 257, 384, 514, 640, 772, 1029, 1030, 1281, 1284, 1285, 1408, 1538, 1540, 1542, 1664, 1792, 1796, 1920, 2056, 2176, 2320, 2592, 2880, 3120, 3152, 3168, 3184

Offset: 1

Gus Wiseman, Aug 18 2019

nonn

A set-system is a finite set of finite nonempty sets. Its elements are sometimes called edges. The dual of a set-system has, for each vertex, one edge consisting of the indices (or positions) of the edges containing that vertex. For example, the dual of {{1,2},{2,3}} is {{1},{1,2},{2}}. This sequence gives all BII-numbers (defined below) of pairwise intersecting set-systems whose dual is strict and pairwise intersecting.

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. We define the set-system with BII-number n to be obtained by taking the binary indices of each binary index of n. Every set-system has a different BII-number. For example, 18 has reversed binary expansion (0,1,0,0,1), and since the binary indices of 2 and 5 are {2} and {1,3} respectively, the BII-number of {{2},{1,3}} is 18.

			The sequence of all set-systems that are pairwise intersecting, cointersecting, and costrict, together with their BII-numbers, begins:
    0: {}
    1: {{1}}
    2: {{2}}
    5: {{1},{1,2}}
    6: {{2},{1,2}}
    8: {{3}}
   17: {{1},{1,3}}
   24: {{3},{1,3}}
   34: {{2},{2,3}}
   40: {{3},{2,3}}
   52: {{1,2},{1,3},{2,3}}
   69: {{1},{1,2},{1,2,3}}
   70: {{2},{1,2},{1,2,3}}
   81: {{1},{1,3},{1,2,3}}
   84: {{1,2},{1,3},{1,2,3}}
   85: {{1},{1,2},{1,3},{1,2,3}}
   88: {{3},{1,3},{1,2,3}}
   98: {{2},{2,3},{1,2,3}}
  100: {{1,2},{2,3},{1,2,3}}
  102: {{2},{1,2},{2,3},{1,2,3}}

Equals the intersection of A326947, A326910, and A326853.
These set-systems are counted by A319774 (covering).
The non-T_0 version is A327061.
Cf. A029931, A048793, A051185, A305843, A319765, A326031, A327037, A327038, A327041, A327052, A327053.

dual[eds_]:=Table[First/@Position[eds,x],{x,Union@@eds}];
bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
stableQ[u_,Q_]:=!Apply[Or,Outer[#1=!=#2&&Q[#1,#2]&,u,u,1],{0,1}];
Select[Range[0,10000],UnsameQ@@dual[bpe/@bpe[#]]&&stableQ[bpe/@bpe[#],Intersection[#1,#2]=={}&]&&stableQ[dual[bpe/@bpe[#]],Intersection[#1,#2]=={}&]&]

A327107 BII-numbers of set-systems with minimum vertex-degree > 1.

Original entry on oeis.org

7, 25, 30, 31, 42, 45, 47, 51, 52, 53, 54, 55, 59, 60, 61, 62, 63, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 90, 91, 92, 93, 94, 95, 97, 99, 100, 101, 102, 103, 105, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124

Offset: 1

Gus Wiseman, Aug 26 2019

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. We define the set-system with BII-number n to be obtained by taking the binary indices of each binary index of n. Every set-system (finite set of finite nonempty sets) has a different BII-number. For example, 18 has reversed binary expansion (0,1,0,0,1), and since the binary indices of 2 and 5 are {2} and {1,3} respectively, the BII-number of {{2},{1,3}} is 18. Elements of a set-system are sometimes called edges.

In a set-system, the degree of a vertex is the number of edges containing it.

			The sequence of all set-systems with maximum degree > 1 together with their BII-numbers begins:
   7: {{1},{2},{1,2}}
  25: {{1},{3},{1,3}}
  30: {{2},{1,2},{3},{1,3}}
  31: {{1},{2},{1,2},{3},{1,3}}
  42: {{2},{3},{2,3}}
  45: {{1},{1,2},{3},{2,3}}
  47: {{1},{2},{1,2},{3},{2,3}}
  51: {{1},{2},{1,3},{2,3}}
  52: {{1,2},{1,3},{2,3}}
  53: {{1},{1,2},{1,3},{2,3}}
  54: {{2},{1,2},{1,3},{2,3}}
  55: {{1},{2},{1,2},{1,3},{2,3}}
  59: {{1},{2},{3},{1,3},{2,3}}
  60: {{1,2},{3},{1,3},{2,3}}
  61: {{1},{1,2},{3},{1,3},{2,3}}
  62: {{2},{1,2},{3},{1,3},{2,3}}
  63: {{1},{2},{1,2},{3},{1,3},{2,3}}
  75: {{1},{2},{3},{1,2,3}}
  76: {{1,2},{3},{1,2,3}}

Positions of terms > 1 in A327103.
BII-numbers for minimum degree 1 are A327105.
Graphs with minimum degree > 1 are counted by A059167.
Cf. A000120, A029931, A048793, A058891, A070939, A245797, A326031, A326701, A326786, A327041, A327104, A327227-A327230.

bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
Select[Range[100],Min@@Length/@Split[Sort[Join@@bpe/@bpe[#]]]>1&]

A327147 Smallest BII-number of a set-system with spanning edge-connectivity n.

Original entry on oeis.org

0, 1, 52, 116, 3952, 8052

Offset: 0

Gus Wiseman, Sep 01 2019

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. We define the set-system with BII-number n to be obtained by taking the binary indices of each binary index of n. Every set-system (finite set of finite nonempty sets) has a different BII-number. For example, 18 has reversed binary expansion (0,1,0,0,1), and since the binary indices of 2 and 5 are {2} and {1,3} respectively, the BII-number of {{2},{1,3}} is 18. Elements of a set-system are sometimes called edges.

The spanning edge-connectivity of a set-system is the minimum number of edges that must be removed (without removing incident vertices) to obtain a set-system that is disconnected or covers fewer vertices.

			The sequence of terms together with their corresponding set-systems begins:
     0: {}
     1: {{1}}
    52: {{1,2},{1,3},{2,3}}
   116: {{1,2},{1,3},{2,3},{1,2,3}}
  3952: {{1,3},{2,3},{1,4},{2,4},{3,4},{1,2,3},{1,2,4}}
  8052: {{1,2},{1,3},{2,3},{1,4},{2,4},{3,4},{1,2,3},{1,2,4},{1,3,4}}

The same for cut-connectivity is A327234.
The same for non-spanning edge-connectivity is A002450.
The spanning edge-connectivity of the set-system with BII-number n is A327144(n).
Cf. A000120, A048793, A070939, A323818, A326031, A326786, A326787, A327041, A327069, A327076, A327108, A327111, A327130, A327145.

A327080 BII-numbers of maximal uniform set-systems (or complete hypergraphs).

Original entry on oeis.org

0, 1, 2, 3, 4, 8, 9, 10, 11, 16, 32, 52, 64, 128, 129, 130, 131, 136, 137, 138, 139, 256, 512, 772, 1024, 2048, 2320, 2592, 2868, 4096, 8192, 13376, 16384, 32768, 32769, 32770, 32771, 32776, 32777, 32778, 32779, 32896, 32897, 32898, 32899, 32904, 32905, 32906

Offset: 1

Gus Wiseman, Aug 20 2019

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. We define the set-system with BII-number n to be obtained by taking the binary indices of each binary index of n. Every set-system (finite set of finite nonempty sets) has a different BII-number. For example, 18 has reversed binary expansion (0,1,0,0,1), and since the binary indices of 2 and 5 are {2} and {1,3} respectively, the BII-number of {{2},{1,3}} is 18. Elements of a set-system are sometimes called edges.

A set-system is uniform if all edges have the same size.

			The sequence of all maximal uniform set-systems together with their BII-numbers begins:
    0: {}
    1: {{1}}
    2: {{2}}
    3: {{1},{2}}
    4: {{1,2}}
    8: {{3}}
    9: {{1},{3}}
   10: {{2},{3}}
   11: {{1},{2},{3}}
   16: {{1,3}}
   32: {{2,3}}
   52: {{1,2},{1,3},{2,3}}
   64: {{1,2,3}}
  128: {{4}}
  129: {{1},{4}}
  130: {{2},{4}}
  131: {{1},{2},{4}}
  136: {{3},{4}}
  137: {{1},{3},{4}}
  138: {{2},{3},{4}}

BII-numbers of uniform set-systems are A326783.
The normal case (where the edges cover an initial interval) is A327081.
Cf. A000120, A048793, A070939, A326031, A326784, A326785, A327041.

bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
Select[Range[0,100],With[{sys=bpe/@bpe[#]},#==0||SameQ@@Length/@sys&&Length[sys]==Binomial[Length[Union@@sys],Length[First[sys]]]]&]

A327081 BII-numbers of maximal uniform set-systems covering an initial interval of positive integers.

Original entry on oeis.org

1, 3, 4, 11, 52, 64, 139, 2868, 13376, 16384, 32907

Offset: 1

Gus Wiseman, Aug 20 2019

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. We define the set-system with BII-number n to be obtained by taking the binary indices of each binary index of n. Every set-system (finite set of finite nonempty sets) has a different BII-number. For example, 18 has reversed binary expansion (0,1,0,0,1), and since the binary indices of 2 and 5 are {2} and {1,3} respectively, the BII-number of {{2},{1,3}} is 18. Elements of a set-system are sometimes called edges.

A set-system is uniform if all edges have the same size.

			The sequence of all maximal uniform set-systems covering an initial interval together with their BII-numbers begins:
      0: {}
      1: {{1}}
      3: {{1},{2}}
      4: {{1,2}}
     11: {{1},{2},{3}}
     52: {{1,2},{1,3},{2,3}}
     64: {{1,2,3}}
    139: {{1},{2},{3},{4}}
   2868: {{1,2},{1,3},{2,3},{1,4},{2,4},{3,4}}
  13376: {{1,2,3},{1,2,4},{1,3,4},{2,3,4}}
  16384: {{1,2,3,4}}
  32907: {{1},{2},{3},{4},{5}}

BII-numbers of uniform set-systems are A326783.
BII-numbers of maximal uniform set-systems are A327080.
Cf. A000120, A048793, A070939, A326031, A326784, A326785, A327041.

bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
normQ[m_]:=Or[m=={},Union[m]==Range[Max[m]]];
Select[Range[1000],With[{sys=bpe/@bpe[#]},#==0||normQ[Union@@sys]&&SameQ@@Length/@sys&&Length[sys]==Binomial[Length[Union@@sys],Length[First[sys]]]]&]

A327061 BII-numbers of pairwise intersecting set-systems where every two covered vertices appear together in some edge (cointersecting).

Original entry on oeis.org

0, 1, 2, 4, 5, 6, 8, 16, 17, 24, 32, 34, 40, 52, 64, 65, 66, 68, 69, 70, 72, 80, 81, 84, 85, 88, 96, 98, 100, 102, 104, 112, 116, 120, 128, 256, 257, 384, 512, 514, 640, 772, 1024, 1025, 1026, 1028, 1029, 1030, 1152, 1280, 1281, 1284, 1285, 1408, 1536, 1538

Offset: 1

Gus Wiseman, Aug 18 2019

nonn

A set-system is a finite set of finite nonempty sets. Its elements are sometimes called edges. The dual of a set-system has, for each vertex, one edge consisting of the indices (or positions) of the edges containing that vertex. For example, the dual of {{1,2},{2,3}} is {{1},{1,2},{2}}. This sequence gives all BII-numbers (defined below) of pairwise intersecting set-systems whose dual is also pairwise intersecting.

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. We define the set-system with BII-number n to be obtained by taking the binary indices of each binary index of n. Every set-system has a different BII-number. For example, 18 has reversed binary expansion (0,1,0,0,1), and since the binary indices of 2 and 5 are {2} and {1,3} respectively, the BII-number of {{2},{1,3}} is 18.

			The sequence of all pairwise intersecting, cointersecting set-systems together with their BII-numbers begins:
   0: {}
   1: {{1}}
   2: {{2}}
   4: {{1,2}}
   5: {{1},{1,2}}
   6: {{2},{1,2}}
   8: {{3}}
  16: {{1,3}}
  17: {{1},{1,3}}
  24: {{3},{1,3}}
  32: {{2,3}}
  34: {{2},{2,3}}
  40: {{3},{2,3}}
  52: {{1,2},{1,3},{2,3}}
  64: {{1,2,3}}
  65: {{1},{1,2,3}}
  66: {{2},{1,2,3}}
  68: {{1,2},{1,2,3}}
  69: {{1},{1,2},{1,2,3}}
  70: {{2},{1,2},{1,2,3}}

The unlabeled multiset partition version is A319765.
Equals the intersection of A326853 and A326910.
The T_0 version is A326854.
These set-systems are counted by A327037 (covering) and A327038 (not covering).
Cf. A029931, A048793, A051185, A305843, A319774, A326031, A327039, A327040, A327041, A327057.

dual[eds_]:=Table[First/@Position[eds,x],{x,Union@@eds}];
bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
stableQ[u_,Q_]:=!Apply[Or,Outer[#1=!=#2&&Q[#1,#2]&,u,u,1],{0,1}];
Select[Range[0,100],stableQ[bpe/@bpe[#],Intersection[#1,#2]=={}&]&&stableQ[dual[bpe/@bpe[#]],Intersection[#1,#2]=={}&]&]

A327106 BII-numbers of set-systems with maximum degree 2.

Original entry on oeis.org

5, 6, 7, 13, 14, 15, 17, 19, 20, 22, 24, 25, 26, 27, 28, 30, 34, 35, 36, 37, 40, 41, 42, 43, 44, 45, 48, 49, 50, 51, 52, 65, 66, 67, 68, 72, 73, 74, 75, 76, 80, 82, 96, 97, 133, 134, 135, 141, 142, 143, 145, 147, 148, 150, 152, 153, 154, 155, 156, 158, 162

Offset: 1

Gus Wiseman, Aug 26 2019

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. We define the set-system with BII-number n to be obtained by taking the binary indices of each binary index of n. Every set-system (finite set of finite nonempty sets) has a different BII-number. For example, 18 has reversed binary expansion (0,1,0,0,1), and since the binary indices of 2 and 5 are {2} and {1,3} respectively, the BII-number of {{2},{1,3}} is 18. Elements of a set-system are sometimes called edges.

In a set-system, the degree of a vertex is the number of edges containing it.

			The sequence of all set-systems with maximum degree 2 together with their BII-numbers begins:
   5: {{1},{1,2}}
   6: {{2},{1,2}}
   7: {{1},{2},{1,2}}
  13: {{1},{1,2},{3}}
  14: {{2},{1,2},{3}}
  15: {{1},{2},{1,2},{3}}
  17: {{1},{1,3}}
  19: {{1},{2},{1,3}}
  20: {{1,2},{1,3}}
  22: {{2},{1,2},{1,3}}
  24: {{3},{1,3}}
  25: {{1},{3},{1,3}}
  26: {{2},{3},{1,3}}
  27: {{1},{2},{3},{1,3}}
  28: {{1,2},{3},{1,3}}
  30: {{2},{1,2},{3},{1,3}}
  34: {{2},{2,3}}
  35: {{1},{2},{2,3}}
  36: {{1,2},{2,3}}
  37: {{1},{1,2},{2,3}}

Positions of 2's in A327104.
Graphs with maximum degree 2 are counted by A136284.
Cf. A000120, A048793, A058891, A070939, A326031, A326701, A326786, A327041, A327103.

bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
Select[Range[0,100],If[#==0,0,Max@@Length/@Split[Sort[Join@@bpe/@bpe[#]]]]==2&]

A327373 BII-numbers of complete simple graphs.

Original entry on oeis.org

0, 1, 4, 52, 2868, 9112372, 141334497921844, 39614688284139543691484924724, 3138550868424102398255194438067307501961665532948002835252, 19701003098197239607207513568280927372312554341759233318802451615112823176074440555010583132712036457851366790597428

Offset: 0

Gus Wiseman, Sep 04 2019

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. We define the set-system with BII-number n to be obtained by taking the binary indices of each binary index of n. Every set-system (finite set of finite nonempty sets) has a different BII-number. For example, 18 has reversed binary expansion (0,1,0,0,1), and since the binary indices of 2 and 5 are {2} and {1,3} respectively, the BII-number of {{2},{1,3}} is 18. Elements of a set-system are sometimes called edges.

BII-numbers of uniform set-systems are A326783.
BII-numbers of maximal uniform set-systems are A327080.
BII-numbers of maximal uniform normal set-systems are A327081.
Cf. A000120, A006125, A018900, A029931, A048793, A070939, A326031, A326784, A326785, A327041.

Table[If[n==1,1,Total[2^(Total[2^#]/2&/@Subsets[Range[n],{2}])]/2],{n,0,10}]

cp's OEIS Frontend

A327104 Maximum vertex-degree of the set-system with BII-number n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A261283 a(n) = bitwise XOR of all the bit numbers for the bits that are set in n, using number 1 for the LSB.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A326854 BII-numbers of T_0 (costrict), pairwise intersecting set-systems where every two vertices appear together in some edge (cointersecting).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A327107 BII-numbers of set-systems with minimum vertex-degree > 1.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A327147 Smallest BII-number of a set-system with spanning edge-connectivity n.

Views

Author

Keywords

Comments

Examples

Crossrefs

A327080 BII-numbers of maximal uniform set-systems (or complete hypergraphs).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A327081 BII-numbers of maximal uniform set-systems covering an initial interval of positive integers.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A327061 BII-numbers of pairwise intersecting set-systems where every two covered vertices appear together in some edge (cointersecting).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A327106 BII-numbers of set-systems with maximum degree 2.

Views

Author

Keywords

Comments

Examples

Crossrefs