cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 41-47 of 47 results.

A329553 Smallest MM-number of a connected set of n multisets.

Original entry on oeis.org

1, 2, 21, 195, 1365, 25935, 435435
Offset: 0

Views

Author

Gus Wiseman, Nov 17 2019

Keywords

Comments

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. The multiset of multisets with MM-number n is formed by taking the multiset of prime indices of each part of the multiset of prime indices of n. For example, the prime indices of 78 are {1,2,6}, so the multiset of multisets with MM-number 78 is {{},{1},{1,2}}.

Examples

			The sequence of terms together with their corresponding systems begins:
       1: {}
       2: {{}}
      21: {{1},{1,1}}
     195: {{1},{2},{1,2}}
    1365: {{1},{2},{1,1},{1,2}}
   25935: {{1},{2},{1,1},{1,2},{1,1,1}}
  435435: {{1},{2},{1,1},{3},{1,2},{1,3}}
		

Crossrefs

MM-numbers of connected sets of sets are A328514.
The weight of the system with MM-number n is A302242(n).
Connected numbers are A305078.
Maximum connected divisor is A327076.
BII-numbers of connected set-systems are A326749.
The smallest BII-number of a connected set-system is A329625.
The case of strict edges is A329552.
The smallest MM-number of a set of n nonempty sets is A329557(n).
Classes of MM-numbers: A305078 (connected), A316476 (antichains), A318991 (chains), A320456 (covers), A329559 (clutters).

Programs

  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    zsm[s_]:=With[{c=Select[Subsets[Range[Length[s]],{2}],GCD@@s[[#]]>1&]},If[c=={},s,zsm[Sort[Append[Delete[s,List/@c[[1]]],LCM@@s[[c[[1]]]]]]]]];
    dae=Select[Range[100000],SquareFreeQ[#]&&Length[zsm[primeMS[#]]]<=1&];
    Table[dae[[Position[PrimeOmega/@dae,k][[1,1]]]],{k,First[Split[Union[PrimeOmega/@dae],#2==#1+1&]]}]

A329661 BII-number of the set-system whose MM-number is A329629(n).

Original entry on oeis.org

0, 1, 2, 8, 4, 3, 128, 16, 32768, 9, 5, 2147483648, 256, 32, 129, 10, 9223372036854775808, 6, 170141183460469231731687303715884105728, 512, 65536, 57896044618658097711785492504343953926634992332820282019728792003956564819968, 130, 17, 32769, 4294967296
Offset: 1

Views

Author

Gus Wiseman, Nov 19 2019

Keywords

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. 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 of positive integers) 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 prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. The multiset of multisets with MM-number n is formed by taking the multiset of prime indices of each part of the multiset of prime indices of n. For example, the prime indices of 78 are {1,2,6}, so the multiset of multisets with MM-number 78 is {{},{1},{1,2}}.

Examples

			The sequence of all set-systems together with their MM-numbers and BII-numbers begins:
             {}:  1 ~ 0
          {{1}}:  3 ~ 1
          {{2}}:  5 ~ 2
          {{3}}: 11 ~ 8
        {{1,2}}: 13 ~ 4
      {{1},{2}}: 15 ~ 3
          {{4}}: 17 ~ 128
        {{1,3}}: 29 ~ 16
          {{5}}: 31 ~ 32768
      {{1},{3}}: 33 ~ 9
    {{1},{1,2}}: 39 ~ 5
          {{6}}: 41 ~ 2147483648
        {{1,4}}: 43 ~ 256
        {{2,3}}: 47 ~ 32
      {{1},{4}}: 51 ~ 129
      {{2},{3}}: 55 ~ 10
          {{7}}: 59 ~ 9223372036854775808
    {{2},{1,2}}: 65 ~ 6
          {{8}}: 67 ~ 170141183460469231731687303715884105728
        {{2,4}}: 73 ~ 512
		

Crossrefs

MM-numbers of set-systems are A329629.
Classes of MM-numbers: A305078 (connected), A316476 (antichains), A318991 (chains), A320456 (covers), A329559 (clutters).
Classes of BII-numbers: A326701 (set partitions), A326703 (chains), A326704 (antichains), A326749 (connected), A326752 (hypertrees), A326754 (covers).

Programs

  • Mathematica
    fbi[q_]:=If[q=={},0,Total[2^q]/2];
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    das=Select[Range[100],OddQ[#]&&SquareFreeQ[#]&&And@@SquareFreeQ/@primeMS[#]&];
    Table[fbi[fbi/@primeMS/@primeMS[n]],{n,das}]

Formula

A326031(a(n)) = A302242(A329629(n)).

A371450 MM-number of the set-system with BII-number n.

Original entry on oeis.org

1, 3, 5, 15, 13, 39, 65, 195, 11, 33, 55, 165, 143, 429, 715, 2145, 29, 87, 145, 435, 377, 1131, 1885, 5655, 319, 957, 1595, 4785, 4147, 12441, 20735, 62205, 47, 141, 235, 705, 611, 1833, 3055, 9165, 517, 1551, 2585, 7755, 6721, 20163, 33605, 100815, 1363, 4089
Offset: 0

Views

Author

Gus Wiseman, Apr 02 2024

Keywords

Comments

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. The multiset of multisets with MM-number n is formed by taking the multiset of prime indices of each part of the multiset of prime indices of n. For example, the prime indices of 78 are {1,2,6}, so the multiset of multisets with MM-number 78 is {{},{1},{1,2}}.
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 of positive integers) 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.

Examples

			The set-system with BII-number 30 is {{2},{1,2},{3},{1,3}} with MM-number prime(3) * prime(6) * prime(5) * prime(10) = 20735.
The terms together with their prime indices and binary indices of prime indices begin:
     1 -> {}        -> {}
     3 -> {2}       -> {{1}}
     5 -> {3}       -> {{2}}
    15 -> {2,3}     -> {{1},{2}}
    13 -> {6}       -> {{1,2}}
    39 -> {2,6}     -> {{1},{1,2}}
    65 -> {3,6}     -> {{2},{1,2}}
   195 -> {2,3,6}   -> {{1},{2},{1,2}}
    11 -> {5}       -> {{3}}
    33 -> {2,5}     -> {{1},{3}}
    55 -> {3,5}     -> {{2},{3}}
   165 -> {2,3,5}   -> {{1},{2},{3}}
   143 -> {5,6}     -> {{1,2},{3}}
   429 -> {2,5,6}   -> {{1},{1,2},{3}}
   715 -> {3,5,6}   -> {{2},{1,2},{3}}
  2145 -> {2,3,5,6} -> {{1},{2},{1,2},{3}}
		

Crossrefs

The sorted version is A329629, with empties A302494.
A019565 gives Heinz number of binary indices.
A048793 lists binary indices, reverse A272020, length A000120, sum A029931.
A070939 gives length of binary expansion.
A112798 lists prime indices, reverse A296150, length A001222, sum A056239.
A326753 counts connected components for BII-numbers, ones A326749.

Programs

  • Mathematica
    bix[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
    Table[Times@@Prime/@(Times@@Prime/@#&/@bix/@bix[n]),{n,0,30}]

A309667 Number of non-isomorphic connected set-systems on up to n vertices.

Original entry on oeis.org

1, 2, 5, 35, 1947, 18664537, 12813206150464222, 33758171486592987151274638818642016, 1435913805026242504952006868879460423801146743462225386062178112354069599
Offset: 0

Views

Author

Gus Wiseman, Aug 11 2019

Keywords

Comments

A set-system is a finite set of finite nonempty sets.

Examples

			Non-isomorphic representatives of the a(0) = 1 through a(2) = 5 set-systems:
  {}  {}     {}
      {{1}}  {{1}}
             {{1,2}}
             {{2},{1,2}}
             {{1},{2},{1,2}}
		

Crossrefs

The covering case is A323819 (first differences).
The BII-numbers of connected set-systems are A326749.
The labeled version is A326964.

A327374 BII-numbers of set-systems with vertex-connectivity 2.

Original entry on oeis.org

52, 53, 54, 55, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116
Offset: 1

Views

Author

Gus Wiseman, Sep 04 2019

Keywords

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. 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 vertex-connectivity of a set-system is the minimum number of vertices that must be removed (along with any resulting empty edges) to obtain a non-connected set-system or singleton. Note that this means a single node has vertex-connectivity 0.

Examples

			The sequence of all set-systems with vertex-connectivity 2 together with their BII-numbers begins:
  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}}
  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}}
  64: {{1,2,3}}
  65: {{1},{1,2,3}}
  66: {{2},{1,2,3}}
  67: {{1},{2},{1,2,3}}
  68: {{1,2},{1,2,3}}
  69: {{1},{1,2},{1,2,3}}
  70: {{2},{1,2},{1,2,3}}
  71: {{1},{2},{1,2},{1,2,3}}
  72: {{3},{1,2,3}}
  73: {{1},{3},{1,2,3}}
  74: {{2},{3},{1,2,3}}
  75: {{1},{2},{3},{1,2,3}}
		

Crossrefs

Positions of 2's in A327051.
Cut-connectivity 2 is A327082.
Spanning edge-connectivity 2 is A327108.
Non-spanning edge-connectivity 2 is A327097.
Vertex-connectivity 3 is A327376.
Labeled graphs with vertex-connectivity 2 are A327198.
Set-systems with vertex-connectivity 2 are A327375.
The enumeration of labeled graphs by vertex-connectivity is A327334.

Programs

  • Mathematica
    bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
    csm[s_]:=With[{c=Select[Subsets[Range[Length[s]],{2}],Length[Intersection@@s[[#]]]>0&]},If[c=={},s,csm[Sort[Append[Delete[s,List/@c[[1]]],Union@@s[[c[[1]]]]]]]]];
    vertConnSys[vts_,eds_]:=Min@@Length/@Select[Subsets[vts],Function[del,Length[del]==Length[vts]-1||csm[DeleteCases[DeleteCases[eds,Alternatives@@del,{2}],{}]]!={Complement[vts,del]}]];
    Select[Range[0,200],vertConnSys[Union@@bpe/@bpe[#],bpe/@bpe[#]]==2&]

A327110 BII-numbers of set-systems with spanning edge-connectivity 3.

Original entry on oeis.org

116, 117, 118, 119, 124, 125, 126, 127, 1796, 1797, 1798, 1799, 1904, 1905, 1906, 1907, 1908, 1909, 1910, 1911, 1912, 1913, 1914, 1915, 1916, 1917, 1918, 1919, 1924, 1925, 1926, 1927, 2032, 2033, 2034, 2035, 2036, 2037, 2038, 2039, 2040, 2041, 2042, 2043, 2044
Offset: 1

Views

Author

Gus Wiseman, Oct 03 2019

Keywords

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. 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.

Examples

			The sequence of all set-systems with spanning edge-connectivity 3 together with their BII-numbers begins:
   116: {{1,2},{1,3},{2,3},{1,2,3}}
   117: {{1},{1,2},{1,3},{2,3},{1,2,3}}
   118: {{2},{1,2},{1,3},{2,3},{1,2,3}}
   119: {{1},{2},{1,2},{1,3},{2,3},{1,2,3}}
   124: {{1,2},{3},{1,3},{2,3},{1,2,3}}
   125: {{1},{1,2},{3},{1,3},{2,3},{1,2,3}}
   126: {{2},{1,2},{3},{1,3},{2,3},{1,2,3}}
   127: {{1},{2},{1,2},{3},{1,3},{2,3},{1,2,3}}
  1796: {{1,2},{1,4},{2,4},{1,2,4}}
  1797: {{1},{1,2},{1,4},{2,4},{1,2,4}}
  1798: {{2},{1,2},{1,4},{2,4},{1,2,4}}
  1799: {{1},{2},{1,2},{1,4},{2,4},{1,2,4}}
  1904: {{1,3},{2,3},{1,2,3},{1,4},{2,4},{1,2,4}}
  1905: {{1},{1,3},{2,3},{1,2,3},{1,4},{2,4},{1,2,4}}
  1906: {{2},{1,3},{2,3},{1,2,3},{1,4},{2,4},{1,2,4}}
  1907: {{1},{2},{1,3},{2,3},{1,2,3},{1,4},{2,4},{1,2,4}}
  1908: {{1,2},{1,3},{2,3},{1,2,3},{1,4},{2,4},{1,2,4}}
  1909: {{1},{1,2},{1,3},{2,3},{1,2,3},{1,4},{2,4},{1,2,4}}
  1910: {{2},{1,2},{1,3},{2,3},{1,2,3},{1,4},{2,4},{1,2,4}}
  1911: {{1},{2},{1,2},{1,3},{2,3},{1,2,3},{1,4},{2,4},{1,2,4}}
		

Crossrefs

Positions of 3's in A327144.
BII-numbers for spanning edge-connectivity 2 are A327108.
BII-numbers for spanning edge-connectivity >= 2 are A327109.
BII-numbers for spanning edge-connectivity 1 are A327111.

Programs

  • Mathematica
    bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
    csm[s_]:=With[{c=Select[Subsets[Range[Length[s]],{2}],Length[Intersection@@s[[#]]]>0&]},If[c=={},s,csm[Sort[Append[Delete[s,List/@c[[1]]],Union@@s[[c[[1]]]]]]]]];
    spanEdgeConn[vts_,eds_]:=Length[eds]-Max@@Length/@Select[Subsets[eds],Union@@#!=vts||Length[csm[#]]!=1&];
    Select[Range[1000],spanEdgeConn[Union@@bpe/@bpe[#],bpe/@bpe[#]]==3&]

A377464 Number of connected pairs of subsets of [n] with each being a different size.

Original entry on oeis.org

0, 0, 2, 12, 62, 290, 1292, 5579, 23606, 98490, 406862, 1668689, 6807704, 27663441, 112076057, 453031502, 1828018406, 7366128866, 29650536878, 119249689265, 479277846962, 1925216817095, 7729973578307, 31025341749680, 124486445913728, 499362094315865
Offset: 0

Views

Author

John Tyler Rascoe, Oct 29 2024

Keywords

Comments

Empirically, a(A075930(n)) == 1 (mod 2).

Examples

			a(3) = 12 counts the pairs: {{1,2},{1}}, {{1,2},{2}}, {{1,3},{1}}, {{1,3},{3}}, {{2,3},{2}}, {{2,3},{3}}, {{1,2,3},{1,2}}, {{1,2,3},{1,3}}, {{1,2,3},{2,3}}, {{1,2,3},{1}}, {{1,2,3},{2}}, {{1,2,3},{3}}.
		

Crossrefs

Programs

  • PARI
    A377464(n) = {sum(i=0,n-2,binomial(n,i)*sum(j=i+1,n-1, binomial(n,j)-binomial(i,n-j)))}

Formula

a(n) = Sum_{i=0..n-2} binomial(n,i) * Sum_{j=i+1..n-1} (binomial(n,j) - binomial(i,n-j)).
Previous Showing 41-47 of 47 results.