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 11-20 of 40 results. Next

A339112 Products of primes of semiprime index (A106349).

Original entry on oeis.org

1, 7, 13, 23, 29, 43, 47, 49, 73, 79, 91, 97, 101, 137, 139, 149, 161, 163, 167, 169, 199, 203, 227, 233, 257, 269, 271, 293, 299, 301, 313, 329, 343, 347, 373, 377, 389, 421, 439, 443, 449, 467, 487, 491, 499, 511, 529, 553, 559, 577, 607, 611, 631, 637, 647
Offset: 1

Views

Author

Gus Wiseman, Mar 12 2021

Keywords

Comments

A semiprime (A001358) is a product of any two prime numbers.
Also MM-numbers of labeled multigraphs with loops (without uncovered vertices). 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 the corresponding multigraphs begins (A..F = 10..15):
     1:            149:   (34)     313:     (36)
     7:   (11)     161: (11)(22)   329:   (11)(23)
    13:   (12)     163:   (18)     343: (11)(11)(11)
    23:   (22)     167:   (26)     347:     (29)
    29:   (13)     169: (12)(12)   373:     (1C)
    43:   (14)     199:   (19)     377:   (12)(13)
    47:   (23)     203: (11)(13)   389:     (45)
    49: (11)(11)   227:   (44)     421:     (1D)
    73:   (24)     233:   (27)     439:     (37)
    79:   (15)     257:   (35)     443:     (1E)
    91: (11)(12)   269:   (28)     449:     (2A)
    97:   (33)     271:   (1A)     467:     (46)
   101:   (16)     293:   (1B)     487:     (2B)
   137:   (25)     299: (12)(22)   491:     (1F)
   139:   (17)     301: (11)(14)   499:     (38)
		

Crossrefs

These primes (of semiprime index) are listed by A106349.
The strict (squarefree) case is A340020.
The prime instead of semiprime version:
primes: A006450
products: A076610
strict: A302590
The nonprime instead of semiprime version:
primes: A007821
products: A320628
odd: A320629
strict: A340104
odd strict: A340105
The squarefree semiprime instead of semiprime version:
strict: A309356
primes: A322551
products: A339113
A001358 lists semiprimes, with odd and even terms A046315 and A100484.
A006881 lists squarefree semiprimes.
A037143 lists primes and semiprimes (and 1).
A056239 gives the sum of prime indices, which are listed by A112798.
A084126 and A084127 give the prime factors of semiprimes.
A101048 counts partitions into semiprimes.
A302242 is the weight of the multiset of multisets with MM-number n.
A305079 is the number of connected components for MM-number n.
A320892 lists even-omega non-products of distinct semiprimes.
A320911 lists products of squarefree semiprimes (Heinz numbers of A338914).
A320912 lists products of distinct semiprimes (Heinz numbers of A338916).
A338898, A338912, and A338913 give the prime indices of semiprimes.
MM-numbers: A255397 (normal), A302478 (set multisystems), A320630 (set multipartitions), A302494 (sets of sets), A305078 (connected), A316476 (antichains), A318991 (chains), A320456 (covers), A328514 (connected sets of sets), A329559 (clutters), A340019 (half-loop graphs).

Programs

  • Maple
    N:= 1000: # for terms up to N
    SP:= {}: p:= 1:
    for i from 1 do
      p:= nextprime(p);
      if 2*p > N then break fi;
      Q:= map(t -> p*t, select(isprime, {2,seq(i,i=3..min(p,N/p),2)}));
      SP:= SP union Q;
    od:
    SP:= sort(convert(SP,list)):
    PSP:= map(ithprime,SP):
    R:= {1}:
    for p in PSP do
      Rp:= {}:
      for k from 1 while p^k <= N do
        Rpk:= select(`<=`,R, N/p^k);
        Rp:= Rp union map(`*`,Rpk, p^k);
      od;
      R:= R union Rp;
    od:
    sort(convert(R,list)); # Robert Israel, Nov 03 2024
  • Mathematica
    semiQ[n_]:=PrimeOmega[n]==2;
    Select[Range[100],FreeQ[If[#==1,{},FactorInteger[#]],{p_,k_}/;!semiQ[PrimePi[p]]]&]

A330061 MM-number of the VDD-normalization of the multiset of multisets with MM-number n.

Original entry on oeis.org

1, 2, 3, 4, 3, 6, 7, 8, 9, 6, 3, 12, 13, 14, 15, 16, 3, 18, 19, 12, 21, 6, 7, 24, 9, 26, 27, 28, 13, 30, 3, 32, 15, 6, 35, 36, 37, 38, 39, 24, 3, 42, 13, 12, 45, 14, 13, 48, 49, 18, 15, 52, 53, 54, 15, 56, 57, 26, 3, 60, 37, 6, 63, 64, 39, 30, 3, 12, 35, 70
Offset: 1

Views

Author

Gus Wiseman, Dec 03 2019

Keywords

Comments

We define the VDD (vertex-degrees decreasing) normalization of a multiset of multisets to be obtained by first normalizing so that the vertices cover an initial interval of positive integers, then applying all permutations to the vertex set, then selecting only the representatives whose vertex-degrees are weakly decreasing, and finally taking the least of these representatives, where the ordering of multisets is first by length and then lexicographically.
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}}.
For example, 15301 is the MM-number of {{3},{1,2},{1,1,4}}, which has the following normalizations together with their MM-numbers:
Brute-force: 43287: {{1},{2,3},{2,2,4}}
Lexicographic: 43143: {{1},{2,4},{2,2,3}}
VDD: 15515: {{2},{1,3},{1,1,4}}
MM: 15265: {{2},{1,4},{1,1,3}}

Crossrefs

This sequence is idempotent and its image/fixed points are A330060.
Non-isomorphic multiset partitions are A007716.
MM-weight is A302242.
Other fixed points:
- Brute-force: A330104 (multisets of multisets), A330107 (multiset partitions), A330099 (set-systems).
- Lexicographic: A330120 (multisets of multisets), A330121 (multiset partitions), A330110 (set-systems).
- VDD: A330060 (multisets of multisets), A330097 (multiset partitions), A330100 (set-systems).
- MM: A330108 (multisets of multisets), A330122 (multiset partitions), A330123 (set-systems).
- BII: A330109 (set-systems).

Programs

  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    sysnorm[m_]:=If[Union@@m!={}&&Union@@m!=Range[Max@@Flatten[m]],sysnorm[m/.Rule@@@Table[{(Union@@m)[[i]],i},{i,Length[Union@@m]}]],First[Sort[sysnorm[m,1]]]];
    sysnorm[m_,aft_]:=If[Length[Union@@m]<=aft,{m},With[{mx=Table[Count[m,i,{2}],{i,Select[Union@@m,#>=aft&]}]},Union@@(sysnorm[#,aft+1]&/@Union[Table[Map[Sort,m/.{par+aft-1->aft,aft->par+aft-1},{0,1}],{par,First/@Position[mx,Max[mx]]}]])]];
    Table[Map[Times@@Prime/@#&,sysnorm[primeMS/@primeMS[n]],{0,1}],{n,100}]

A320458 MM-numbers of labeled simple graphs spanning an initial interval of positive integers.

Original entry on oeis.org

1, 13, 377, 611, 1363, 1937, 2021, 2117, 16211, 17719, 26273, 27521, 44603, 56173, 58609, 83291, 91031, 91039, 99499, 141401, 143663, 146653, 147533, 153023, 159659, 167243, 170839, 203087, 237679, 243893, 265369, 271049, 276877, 290029, 301129, 315433, 467711
Offset: 1

Views

Author

Gus Wiseman, Oct 13 2018

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 multisystem 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 multisystem with MM-number 78 is {{},{1},{1,2}}.

Examples

			The sequence of terms together with their multiset multisystems begins:
      1: {}
     13: {{1,2}}
    377: {{1,2},{1,3}}
    611: {{1,2},{2,3}}
   1363: {{1,3},{2,3}}
   1937: {{1,2},{3,4}}
   2021: {{1,4},{2,3}}
   2117: {{1,3},{2,4}}
  16211: {{1,2},{1,3},{1,4}}
  17719: {{1,2},{1,3},{2,3}}
  26273: {{1,2},{1,4},{2,3}}
  27521: {{1,2},{1,3},{2,4}}
  44603: {{1,2},{2,3},{2,4}}
  56173: {{1,2},{1,3},{3,4}}
  58609: {{1,3},{1,4},{2,3}}
  83291: {{1,2},{1,4},{3,4}}
  91031: {{1,3},{1,4},{2,4}}
  91039: {{1,2},{2,3},{3,4}}
  99499: {{1,3},{2,3},{2,4}}
		

Crossrefs

Programs

  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    normQ[sys_]:=Or[Length[sys]==0,Union@@sys==Range[Max@@Max@@sys]];
    Select[Range[10000],And[SquareFreeQ[#],normQ[primeMS/@primeMS[#]],And@@(And[SquareFreeQ[#],Length[primeMS[#]]==2]&/@primeMS[#])]&]

A320462 MM-numbers of labeled multigraphs with loops spanning an initial interval of positive integers.

Original entry on oeis.org

1, 7, 13, 49, 91, 161, 169, 299, 329, 343, 377, 611, 637, 667, 1127, 1183, 1261, 1363, 1937, 2021, 2093, 2117, 2197, 2303, 2401, 2639, 3703, 3887, 4277, 4459, 4669, 4901, 6877, 7567, 7889, 7943, 8281, 8671, 8827, 9541, 10933, 13559, 14053, 14147, 14651, 14819
Offset: 1

Views

Author

Gus Wiseman, Oct 13 2018

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 multisystem 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 multisystem with MM-number 78 is {{},{1},{1,2}}.

Examples

			The sequence of terms together with their multiset multisystems begins:
     1: {}
     7: {{1,1}}
    13: {{1,2}}
    49: {{1,1},{1,1}}
    91: {{1,1},{1,2}}
   161: {{1,1},{2,2}}
   169: {{1,2},{1,2}}
   299: {{2,2},{1,2}}
   329: {{1,1},{2,3}}
   343: {{1,1},{1,1},{1,1}}
   377: {{1,2},{1,3}}
   611: {{1,2},{2,3}}
   637: {{1,1},{1,1},{1,2}}
   667: {{2,2},{1,3}}
  1127: {{1,1},{1,1},{2,2}}
  1183: {{1,1},{1,2},{1,2}}
		

Crossrefs

Programs

  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    normQ[sys_]:=Or[Length[sys]==0,Union@@sys==Range[Max@@Max@@sys]];
    Select[Range[10000],And[normQ[primeMS/@primeMS[#]],And@@(Length[primeMS[#]]==2&/@primeMS[#])]&]

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

A320459 MM-numbers of labeled multigraphs spanning an initial interval of positive integers.

Original entry on oeis.org

1, 13, 169, 377, 611, 1363, 1937, 2021, 2117, 2197, 4901, 7943, 10933, 16211, 17719, 25181, 26273, 27521, 28561, 28717, 39527, 44603, 56173, 58609, 61393, 63713, 64061, 83291, 86903, 91031, 91039, 94987, 99499, 103259, 141401, 142129, 143663, 146653, 147533
Offset: 1

Views

Author

Gus Wiseman, Oct 13 2018

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 multisystem 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 multisystem with MM-number 78 is {{},{1},{1,2}}.

Examples

			The sequence of terms together with their multiset multisystems begins:
      1: {}
     13: {{1,2}}
    169: {{1,2},{1,2}}
    377: {{1,2},{1,3}}
    611: {{1,2},{2,3}}
   1363: {{1,3},{2,3}}
   1937: {{1,2},{3,4}}
   2021: {{1,4},{2,3}}
   2117: {{1,3},{2,4}}
   2197: {{1,2},{1,2},{1,2}}
   4901: {{1,2},{1,2},{1,3}}
   7943: {{1,2},{1,2},{2,3}}
  10933: {{1,2},{1,3},{1,3}}
  16211: {{1,2},{1,3},{1,4}}
  17719: {{1,2},{1,3},{2,3}}
  25181: {{1,2},{1,2},{3,4}}
  26273: {{1,2},{1,4},{2,3}}
  27521: {{1,2},{1,3},{2,4}}
  28561: {{1,2},{1,2},{1,2},{1,2}}
  28717: {{1,2},{2,3},{2,3}}
  39527: {{1,3},{1,3},{2,3}}
  44603: {{1,2},{2,3},{2,4}}
		

Crossrefs

Programs

  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    normQ[sys_]:=Or[Length[sys]==0,Union@@sys==Range[Max@@Max@@sys]];
    Select[Range[100000],And[normQ[primeMS/@primeMS[#]],And@@(And[SquareFreeQ[#],Length[primeMS[#]]==2]&/@primeMS[#])]&]

A320532 MM-numbers of labeled hypergraphs with multiset edges and no singletons spanning an initial interval of positive integers.

Original entry on oeis.org

1, 7, 13, 19, 37, 53, 61, 89, 91, 113, 131, 133, 151, 161, 223, 247, 251, 259, 281, 299, 311, 329, 359, 371, 377, 427, 437, 463, 481, 503, 593, 611, 623, 659, 667, 689, 703, 719, 721, 791, 793, 827, 851, 863, 893, 917, 923, 953, 1007, 1057, 1069, 1073, 1157
Offset: 1

Views

Author

Gus Wiseman, Oct 14 2018

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 multisystem 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 multisystem with MM-number 78 is {{},{1},{1,2}}.

Examples

			The sequence of terms together with their multiset multisystems begins:
    1: {}
    7: {{1,1}}
   13: {{1,2}}
   19: {{1,1,1}}
   37: {{1,1,2}}
   53: {{1,1,1,1}}
   61: {{1,2,2}}
   89: {{1,1,1,2}}
   91: {{1,1},{1,2}}
  113: {{1,2,3}}
  131: {{1,1,1,1,1}}
  133: {{1,1},{1,1,1}}
  151: {{1,1,2,2}}
  161: {{1,1},{2,2}}
  223: {{1,1,1,1,2}}
  247: {{1,2},{1,1,1}}
  251: {{1,2,2,2}}
  259: {{1,1},{1,1,2}}
  281: {{1,1,2,3}}
  299: {{1,2},{2,2}}
  311: {{1,1,1,1,1,1}}
  329: {{1,1},{2,3}}
  359: {{1,1,1,2,2}}
  371: {{1,1},{1,1,1,1}}
		

Crossrefs

Programs

  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    normQ[sys_]:=Or[Length[sys]==0,Union@@sys==Range[Max@@Max@@sys]];
    Select[Range[1000],And[SquareFreeQ[#],normQ[primeMS/@primeMS[#]],And@@(And[PrimeOmega[#]>1]&/@primeMS[#])]&]

A320533 MM-numbers of labeled multi-hypergraphs with multiset edges and no singletons spanning an initial interval of positive integers.

Original entry on oeis.org

1, 7, 13, 19, 37, 49, 53, 61, 89, 91, 113, 131, 133, 151, 161, 169, 223, 247, 251, 259, 281, 299, 311, 329, 343, 359, 361, 371, 377, 427, 437, 463, 481, 503, 593, 611, 623, 637, 659, 667, 689, 703, 719, 721, 791, 793, 827, 851, 863, 893, 917, 923, 931, 953
Offset: 1

Views

Author

Gus Wiseman, Oct 14 2018

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 multisystem 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 multisystem with MM-number 78 is {{},{1},{1,2}}.

Examples

			The sequence of terms together with their multiset multisystems begins:
    1: {}
    7: {{1,1}}
   13: {{1,2}}
   19: {{1,1,1}}
   37: {{1,1,2}}
   49: {{1,1},{1,1}}
   53: {{1,1,1,1}}
   61: {{1,2,2}}
   89: {{1,1,1,2}}
   91: {{1,1},{1,2}}
  113: {{1,2,3}}
  131: {{1,1,1,1,1}}
  133: {{1,1},{1,1,1}}
  151: {{1,1,2,2}}
  161: {{1,1},{2,2}}
  169: {{1,2},{1,2}}
  223: {{1,1,1,1,2}}
  247: {{1,2},{1,1,1}}
  251: {{1,2,2,2}}
  259: {{1,1},{1,1,2}}
  281: {{1,1,2,3}}
  299: {{1,2},{2,2}}
  311: {{1,1,1,1,1,1}}
  329: {{1,1},{2,3}}
  343: {{1,1},{1,1},{1,1}}
		

Crossrefs

Programs

  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    normQ[sys_]:=Or[Length[sys]==0,Union@@sys==Range[Max@@Max@@sys]];
    Select[Range[1000],And[normQ[primeMS/@primeMS[#]],And@@(And[PrimeOmega[#]>1]&/@primeMS[#])]&]

A330194 MM-number of the MM-normalization of the multiset of multisets with MM-number n.

Original entry on oeis.org

1, 2, 3, 4, 3, 6, 7, 8, 9, 6, 3, 12, 13, 14, 15, 16, 3, 18, 19, 12, 21, 6, 7, 24, 9, 26, 27, 28, 13, 30, 3, 32, 15, 6, 35, 36, 37, 38, 39, 24, 3, 42, 13, 12, 45, 14, 13, 48, 49, 18, 15, 52, 53, 54, 15, 56, 57, 26, 3, 60, 37, 6, 63, 64, 39, 30, 3, 12, 35, 70
Offset: 1

Views

Author

Gus Wiseman, Dec 05 2019

Keywords

Comments

First differs from A330105 at a(35) = 35, A330105(35) = 69.
First differs from A330061 at a(175) = 175, A330061(175) = 207.
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}}.
We define the MM-normalization of a multiset of multisets to be obtained by first normalizing so that the vertices cover an initial interval of positive integers, then applying all permutations to the vertex set, and finally taking the representative with the smallest MM-number.
For example, 15301 is the MM-number of {{3},{1,2},{1,1,4}}, which has the following normalizations together with their MM-numbers:
Brute-force: 43287: {{1},{2,3},{2,2,4}}
Lexicographic: 43143: {{1},{2,4},{2,2,3}}
VDD: 15515: {{2},{1,3},{1,1,4}}
MM: 15265: {{2},{1,4},{1,1,3}}

Crossrefs

This sequence is idempotent and its image/fixed points are A330108.
Non-isomorphic multiset partitions are A007716.
MM-weight is A302242.
Other fixed points:
- Brute-force: A330104 (multisets of multisets), A330107 (multiset partitions), A330099 (set-systems).
- Lexicographic: A330120 (multisets of multisets), A330121 (multiset partitions), A330110 (set-systems).
- VDD: A330060 (multisets of multisets), A330097 (multiset partitions), A330100 (set-systems).
- MM: A330108 (multisets of multisets), A330122 (multiset partitions), A330123 (set-systems).
- BII: A330109 (set-systems).

Programs

  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    mmnorm[m_]:=If[Union@@m!={}&&Union@@m!=Range[Max@@Flatten[m]],mmnorm[m/.Rule@@@Table[{(Union@@m)[[i]],i},{i,Length[Union@@m]}]],First[SortBy[brute[m,1],Map[Times@@Prime/@#&,#,{0,1}]&]]];
    brute[m_,1]:=Table[Sort[Sort/@(m/.Rule@@@Table[{i,p[[i]]},{i,Length[p]}])],{p,Permutations[Union@@m]}];
    Table[Map[Times@@Prime/@#&,mmnorm[primeMS/@primeMS[n]],{0,1}],{n,100}]

Formula

a(n) <= n.

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&]]}]
Previous Showing 11-20 of 40 results. Next