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.

Showing 1-5 of 5 results.

A329557 Smallest MM-number of a set of n nonempty sets.

Original entry on oeis.org

1, 3, 15, 165, 2145, 36465, 1057485, 32782035, 1344063435, 57794727705, 2716352202135, 160264779925965, 10737740255039655, 783855038617894815, 61924548050813690385, 5139737488217536301955, 519113486309971166497455, 56583370007786857148222595, 6393920810879914857749153235
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: {}
        3: {{1}}
       15: {{1},{2}}
      165: {{1},{2},{3}}
     2145: {{1},{2},{3},{1,2}}
    36465: {{1},{2},{3},{1,2},{4}}
  1057485: {{1},{2},{3},{1,2},{4},{1,3}}
		

Crossrefs

MM-numbers of sets of sets are A302494.
MM-numbers of sets of nonempty sets are A329629.
The version allowing empty sets is A329558.
The version without singletons is A329554.
Other 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}]]]];
    dae=Select[Range[10000],SquareFreeQ[#]&&And@@SquareFreeQ/@primeMS[#]&&FreeQ[primeMS[#],1]&];
    Table[dae[[Position[PrimeOmega/@dae,k][[1,1]]]],{k,First[Split[Union[PrimeOmega/@dae],#2==#1+1&]]}]
  • PARI
    a(n) = my(k=1); prod(i=1, n, until(issquarefree(k), k++); prime(k)); \\ Jinyuan Wang, Feb 23 2025

Formula

a(n) = A329558(n + 1)/2.

Extensions

More terms from Jinyuan Wang, Feb 23 2025

A329552 Smallest MM-number of a connected set of n sets.

Original entry on oeis.org

1, 2, 39, 195, 5655, 62205, 2674815
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: {{}}
       39: {{1},{1,2}}
      195: {{1},{2},{1,2}}
     5655: {{1},{2},{1,2},{1,3}}
    62205: {{1},{2},{3},{1,2},{1,3}}
  2674815: {{1},{2},{3},{1,2},{1,3},{1,4}}
		

Crossrefs

MM-numbers of connected set-systems 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 sets of sets are A326749.
The smallest BII-number of a connected set of n sets is A329625(n).
Allowing edges to have repeated vertices gives A329553.
Requiring the edges to form an antichain gives A329555.
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[Tuples[Range[Length[s]],2],And[Less@@#,GCD@@s[[#]]]>1&]},If[c=={},s,zsm[Sort[Append[Delete[s,List/@c[[1]]],LCM@@s[[c[[1]]]]]]]]];
    da=Select[Range[10000],SquareFreeQ[#]&&And@@SquareFreeQ/@primeMS[#]&&Length[zsm[primeMS[#]]]<=1&];
    Table[da[[Position[PrimeOmega/@da,n][[1,1]]]],{n,First[Split[Union[PrimeOmega/@da],#2==#1+1&]]}]

A329558 Product of primes indexed by the first n squarefree numbers.

Original entry on oeis.org

1, 2, 6, 30, 330, 4290, 72930, 2114970, 65564070, 2688126870, 115589455410, 5432704404270, 320529559851930, 21475480510079310, 1567710077235789630, 123849096101627380770, 10279474976435072603910, 1038226972619942332994910, 113166740015573714296445190, 12787841621759829715498306470
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}}. Then a(n) is the smallest MM-number of a set of n sets.

Examples

			The sequence of terms together with their corresponding systems begins:
        1: {}
        2: {{}}
        6: {{},{1}}
       30: {{},{1},{2}}
      330: {{},{1},{2},{3}}
     4290: {{},{1},{2},{3},{1,2}}
    72930: {{},{1},{2},{3},{1,2},{4}}
  2114970: {{},{1},{2},{3},{1,2},{4},{1,3}}
		

Crossrefs

The smallest BII-number of a set of n sets is A000225(n).
MM-numbers of sets of sets are A302494.
The case without empty edges is A329557.
The case without singletons is A329556.
The case without empty edges or singletons is A329554.
The connected version is A329552.
Classes of MM-numbers: A305078 (connected), A316476 (antichains), A318991 (chains), A320456 (covers), A329559 (clutters).

Programs

  • Mathematica
    sqvs=Select[Range[30],SquareFreeQ];
    Table[Times@@Prime/@Take[sqvs,k],{k,0,Length[sqvs]}]

Formula

a(n > 0) = 2 * A329557(n - 1).
a(n) = Product_{i = 1..n} prime(A005117(i)).

Extensions

a(19) from Jinyuan Wang, Feb 24 2020

A329556 Smallest MM-number of a set of n sets with no singletons.

Original entry on oeis.org

1, 2, 26, 754, 32422, 1523834
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: {{}}
       26: {{},{1,2}}
      754: {{},{1,2},{1,3}}
    32422: {{},{1,2},{1,3},{1,4}}
  1523834: {{},{1,2},{1,3},{1,4},{2,3}}
		

Crossrefs

MM-numbers of sets of sets with no singletons are A329630.
The case without empty edges is A329554.
MM-numbers of sets of sets are A302494.
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}]]]];
    dae=Select[Range[100000],SquareFreeQ[#]&&And@@SquareFreeQ/@primeMS[#]&&FreeQ[primeMS[#],_?PrimeQ]&];
    Table[dae[[Position[PrimeOmega/@dae,k][[1,1]]]],{k,First[Split[Union[PrimeOmega/@dae],#2==#1+1&]]}]

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&]]}]
Showing 1-5 of 5 results.