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 21-30 of 36 results. Next

A382458 Number of normal multisets of size n that can be partitioned into a set of sets in exactly one way.

Original entry on oeis.org

1, 1, 0, 2, 1, 3, 0, 7, 3, 11, 18, 9
Offset: 0

Views

Author

Gus Wiseman, Mar 30 2025

Keywords

Comments

We call a multiset or multiset partition normal iff it covers an initial interval of positive integers. The size of a multiset is the number of elements, counting multiplicity.

Examples

			The normal multiset {1,2,2,2,2,3,3,4} has three multiset partitions into a set of sets:
  {{2},{1,2},{2,3},{2,3,4}}
  {{2},{2,3},{2,4},{1,2,3}}
  {{2},{3},{1,2},{2,3},{2,4}}
so is not counted under a(8).
The a(1) = 1 through a(7) = 7 normal multisets:
  {1}  .  {1,1,2}  {1,1,2,2}  {1,1,1,2,3}  .  {1,1,1,1,2,3,4}
          {1,2,2}             {1,2,2,2,3}     {1,1,1,2,2,2,3}
                              {1,2,3,3,3}     {1,1,1,2,3,3,3}
                                              {1,2,2,2,2,3,4}
                                              {1,2,2,2,3,3,3}
                                              {1,2,3,3,3,3,4}
                                              {1,2,3,4,4,4,4}
		

Crossrefs

For constant instead of strict blocks we have A000045.
Factorizations of this type are counted by A050326, with distinct sums A381633.
For the strong case see A292444, A382430, complement A381996, A382523.
MM-numbers of sets of sets are A302494, see A302478, A382201.
Twice-partitions into distinct sets are counted by A358914, with distinct sums A279785.
For integer partitions we have A382079 (A293511), with distinct sums A382460, (A381870).
With distinct sums we have A382459.
Set multipartitions: A050320, A089259, A116540, A270995, A296119, A318360.
Normal multiset partitions: A034691, A035310, A116539, A255906, A381718.
Set systems: A050342, A296120, A318361.

Programs

  • Mathematica
    allnorm[n_]:=If[n<=0,{{}},Function[s,Array[Count[s,y_/;y<=#]+1&,n]] /@ Subsets[Range[n-1]+1]];
    sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]] /@ Cases[Subsets[set],{i,_}];
    mps[mset_]:=Union[Sort[Sort/@(#/.x_Integer:>mset[[x]])]& /@ sps[Range[Length[mset]]]];
    Table[Length[Select[allnorm[n], Length[Select[mps[#], UnsameQ@@#&&And@@UnsameQ@@@#&]]==1&]], {n,0,5}]

A382459 Number of normal multisets of size n that can be partitioned into a set of sets with distinct sums in exactly one way.

Original entry on oeis.org

1, 1, 0, 2, 1, 3, 2, 7, 4, 10, 19
Offset: 0

Views

Author

Gus Wiseman, Apr 01 2025

Keywords

Comments

We call a multiset or multiset partition normal iff it covers an initial interval of positive integers. The size of a multiset is the number of elements, counting multiplicity.

Examples

			The normal multiset {1,2,2,2,2,3,3,4} has only one multiset partition into a set of sets with distinct sums: {{2},{1,2},{2,3},{2,3,4}}, so is counted under a(8).
The a(1) = 1 through a(7) = 7 multisets:
  {1}  .  {112}  {1122}  {11123}  {111233}  {1111234}
          {122}          {12223}  {122233}  {1112223}
                         {12333}            {1112333}
                                            {1222234}
                                            {1222333}
                                            {1233334}
                                            {1234444}
		

Crossrefs

Twice-partitions of this type are counted by A279785, A270995, A358914.
Factorizations of this type are counted by A381633, A050320, A050326.
Normal multiset partitions of this type are A381718, A116540, A116539.
Multiset partitions of this type are ranked by A382201, A302478, A302494.
For at least one choice: A382216 (strict A382214), complement A382202 (strict A292432).
For the strong case see: A382430 (strict A292444), complement A382523 (strict A381996).
Without distinct sums we have A382458.
For integer partitions we have A382460, ranks A381870, strict A382079, ranks A293511.
Set multipartitions: A089259, A296119, A318360.
Normal multiset partitions: A034691, A035310, A255906.
Set systems: A050342, A296120, A318361.

Programs

  • Mathematica
    allnorm[n_]:=If[n<=0,{{}},Function[s,Array[Count[s,y_/;y<=#]+1&,n]]/@Subsets[Range[n-1]+1]];
    sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
    mps[mset_]:=Union[Sort[Sort/@(#/.x_Integer:>mset[[x]])]&/@sps[Range[Length[mset]]]];
    Table[Length[Select[allnorm[n],Length[Select[mps[#],UnsameQ@@Total/@#&&And@@UnsameQ@@@#&]]==1&]],{n,0,5}]

A302496 Products of distinct primes of prime-power index.

Original entry on oeis.org

1, 2, 3, 5, 6, 7, 10, 11, 14, 15, 17, 19, 21, 22, 23, 30, 31, 33, 34, 35, 38, 41, 42, 46, 51, 53, 55, 57, 59, 62, 66, 67, 69, 70, 77, 82, 83, 85, 93, 95, 97, 102, 103, 105, 106, 109, 110, 114, 115, 118, 119, 123, 127, 131, 133, 134, 138, 154, 155, 157, 159
Offset: 1

Views

Author

Gus Wiseman, Apr 09 2018

Keywords

Comments

A prime index of n is a number m such that prime(m) divides n.

Examples

			Entry A302242 describes a correspondence between positive integers and multiset multisystems. In this case it gives the following sequence of constant-multiset systems.
01: {}
02: {{}}
03: {{1}}
05: {{2}}
06: {{},{1}}
07: {{1,1}}
10: {{},{2}}
11: {{3}}
14: {{},{1,1}}
15: {{1},{2}}
17: {{4}}
19: {{1,1,1}}
21: {{1},{1,1}}
22: {{},{3}}
23: {{2,2}}
30: {{},{1},{2}}
31: {{5}}
33: {{1},{3}}
34: {{},{4}}
35: {{2},{1,1}}
38: {{},{1,1,1}}
		

Crossrefs

Programs

  • Mathematica
    Select[Range[nn],Or[#===1,SquareFreeQ[#]&&And@@PrimePowerQ/@PrimePi/@DeleteCases[FactorInteger[#][[All,1]],2]]&]
  • PARI
    is(n) = if(bigomega(n)!=omega(n), return(0), my(f=factor(n)[, 1]~); for(k=1, #f, if(!isprimepower(primepi(f[k])) && primepi(f[k])!=1, return(0)))); 1 \\ Felix Fröhlich, Apr 10 2018

A327398 Maximum connected squarefree divisor of n.

Original entry on oeis.org

1, 2, 3, 2, 5, 3, 7, 2, 3, 5, 11, 3, 13, 7, 5, 2, 17, 3, 19, 5, 21, 11, 23, 3, 5, 13, 3, 7, 29, 5, 31, 2, 11, 17, 7, 3, 37, 19, 39, 5, 41, 21, 43, 11, 5, 23, 47, 3, 7, 5, 17, 13, 53, 3, 11, 7, 57, 29, 59, 5, 61, 31, 21, 2, 65, 11, 67, 17, 23, 7, 71, 3, 73, 37
Offset: 1

Views

Author

Gus Wiseman, Oct 20 2019

Keywords

Comments

A squarefree number with prime factorization prime(m_1) * ... * prime(m_k) is connected if the simple labeled graph with vertex set {m_1,...,m_k} and edges between any two vertices with a common divisor greater than 1 is connected. Connected numbers are listed in A305078.

Examples

			The connected squarefree divisors of 189 are {1, 3, 7, 21}, so a(189) = 21.
		

Crossrefs

The maximum connected divisor of n is A327076(n).
The maximum squarefree divisor of n is A007947(n).
Connected numbers are A305078.
Connected squarefree numbers are A328513.

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]]]]]]]]];
    Table[Max[Select[Divisors[n],SquareFreeQ[#]&&Length[zsm[primeMS[#]]]<=1&]],{n,100}]

A329629 Products of distinct odd primes of squarefree index.

Original entry on oeis.org

1, 3, 5, 11, 13, 15, 17, 29, 31, 33, 39, 41, 43, 47, 51, 55, 59, 65, 67, 73, 79, 83, 85, 87, 93, 101, 109, 113, 123, 127, 129, 137, 139, 141, 143, 145, 149, 155, 157, 163, 165, 167, 177, 179, 181, 187, 191, 195, 199, 201, 205, 211, 215, 219, 221, 233, 235, 237
Offset: 1

Views

Author

Gus Wiseman, Nov 18 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}}. This sequence lists all MM-numbers of set-systems (sets of nonempty sets).

Examples

			The sequence of terms together with their corresponding set-systems begins:
   1: {}
   3: {{1}}
   5: {{2}}
  11: {{3}}
  13: {{1,2}}
  15: {{1},{2}}
  17: {{4}}
  29: {{1,3}}
  31: {{5}}
  33: {{1},{3}}
  39: {{1},{1,2}}
  41: {{6}}
  43: {{1,4}}
  47: {{2,3}}
  51: {{1},{4}}
  55: {{2},{3}}
  59: {{7}}
  65: {{2},{1,2}}
  67: {{8}}
  73: {{2,4}}
		

Crossrefs

Allowing even terms (systems with empty edges) gives A302494.
Classes of MM-numbers: A305078 (connected), A316476 (antichains), A318991 (chains), A320456 (covers), A329559 (clutters).

Programs

  • Mathematica
    Select[Range[100],OddQ[#]&&SquareFreeQ[#]&&And@@SquareFreeQ/@PrimePi/@First/@If[#==1,{},FactorInteger[#]]&]

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&]]}]

A329630 Products of distinct primes of nonprime squarefree index.

Original entry on oeis.org

1, 2, 13, 26, 29, 43, 47, 58, 73, 79, 86, 94, 101, 113, 137, 139, 146, 149, 158, 163, 167, 181, 199, 202, 226, 233, 257, 269, 271, 274, 278, 293, 298, 313, 317, 326, 334, 347, 349, 362, 373, 377, 389, 397, 398, 421, 439, 443, 449, 466, 467, 487, 491, 499, 514
Offset: 1

Views

Author

Gus Wiseman, Nov 18 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}}. This sequence lists all MM-numbers of sets of non-singleton sets.

Examples

			The sequence of terms together with their corresponding sets of sets begins:
    1: {}
    2: {{}}
   13: {{1,2}}
   26: {{},{1,2}}
   29: {{1,3}}
   43: {{1,4}}
   47: {{2,3}}
   58: {{},{1,3}}
   73: {{2,4}}
   79: {{1,5}}
   86: {{},{1,4}}
   94: {{},{2,3}}
  101: {{1,6}}
  113: {{1,2,3}}
  137: {{2,5}}
  139: {{1,7}}
  146: {{},{2,4}}
  149: {{3,4}}
  158: {{},{1,5}}
  163: {{1,8}}
		

Crossrefs

MM-numbers of sets of nonempty sets are A329629.
Products of primes of nonprime squarefree index are A320630.
Products of prime numbers of squarefree index are A302478.
Products of primes of nonprime index are A320628.
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}]]]];
    Select[Range[100],SquareFreeQ[#]&&And@@SquareFreeQ/@primeMS[#]&&!MemberQ[primeMS[#],_?PrimeQ]&]

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

A340104 Products of distinct primes of nonprime index (A007821).

Original entry on oeis.org

1, 2, 7, 13, 14, 19, 23, 26, 29, 37, 38, 43, 46, 47, 53, 58, 61, 71, 73, 74, 79, 86, 89, 91, 94, 97, 101, 103, 106, 107, 113, 122, 131, 133, 137, 139, 142, 146, 149, 151, 158, 161, 163, 167, 173, 178, 181, 182, 193, 194, 197, 199, 202, 203, 206, 214, 223, 226
Offset: 1

Views

Author

Gus Wiseman, Mar 12 2021

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.

Examples

			The sequence of terms together with the corresponding prime indices of prime indices begins:
     1: {}              58: {{},{1,3}}        113: {{1,2,3}}
     2: {{}}            61: {{1,2,2}}         122: {{},{1,2,2}}
     7: {{1,1}}         71: {{1,1,3}}         131: {{1,1,1,1,1}}
    13: {{1,2}}         73: {{2,4}}           133: {{1,1},{1,1,1}}
    14: {{},{1,1}}      74: {{},{1,1,2}}      137: {{2,5}}
    19: {{1,1,1}}       79: {{1,5}}           139: {{1,7}}
    23: {{2,2}}         86: {{},{1,4}}        142: {{},{1,1,3}}
    26: {{},{1,2}}      89: {{1,1,1,2}}       146: {{},{2,4}}
    29: {{1,3}}         91: {{1,1},{1,2}}     149: {{3,4}}
    37: {{1,1,2}}       94: {{},{2,3}}        151: {{1,1,2,2}}
    38: {{},{1,1,1}}    97: {{3,3}}           158: {{},{1,5}}
    43: {{1,4}}        101: {{1,6}}           161: {{1,1},{2,2}}
    46: {{},{2,2}}     103: {{2,2,2}}         163: {{1,8}}
    47: {{2,3}}        106: {{},{1,1,1,1}}    167: {{2,6}}
    53: {{1,1,1,1}}    107: {{1,1,4}}         173: {{1,1,1,3}}
		

Crossrefs

These primes (of nonprime index) are listed by A007821.
The non-strict version is A320628, with odd case A320629.
The odd case is A340105.
The prime instead of nonprime version:
primes: A006450
products: A076610
strict: A302590
The semiprime instead of nonprime version:
primes: A106349
products: A339112
strict: A340020
The squarefree semiprime instead of nonprime version:
strict: A309356
primes: A322551
products: A339113
A056239 gives the sum of prime indices, which are listed by A112798.
A257994 counts prime prime indices.
A302242 is the weight of the multiset of multisets with MM-number n.
A305079 is the number of connected components for MM-number n.
A320911 lists products of squarefree semiprimes (Heinz numbers of A338914).
A320912 lists products of distinct semiprimes (Heinz numbers of A338916).
A330944 counts nonprime prime indices.
A330945 lists numbers with a nonprime prime index (nonprime case: A330948).
A339561 lists products of distinct squarefree semiprimes (A339560).
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

  • Mathematica
    Select[Range[100],SquareFreeQ[#]&&FreeQ[If[#==1,{},FactorInteger[#]],{p_,k_}/;PrimeQ[PrimePi[p]]]&]

Formula

Equals A005117 /\ A320628.

A340105 Odd products of distinct primes of nonprime index (A007821).

Original entry on oeis.org

1, 7, 13, 19, 23, 29, 37, 43, 47, 53, 61, 71, 73, 79, 89, 91, 97, 101, 103, 107, 113, 131, 133, 137, 139, 149, 151, 161, 163, 167, 173, 181, 193, 197, 199, 203, 223, 227, 229, 233, 239, 247, 251, 257, 259, 263, 269, 271, 281, 293, 299, 301, 307, 311, 313, 317
Offset: 1

Views

Author

Gus Wiseman, Mar 12 2021

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.

Examples

			The sequence of terms together with the corresponding sets of multisets begins:
     1: {}              91: {{1,1},{1,2}}      173: {{1,1,1,3}}
     7: {{1,1}}         97: {{3,3}}            181: {{1,2,4}}
    13: {{1,2}}        101: {{1,6}}            193: {{1,1,5}}
    19: {{1,1,1}}      103: {{2,2,2}}          197: {{2,2,3}}
    23: {{2,2}}        107: {{1,1,4}}          199: {{1,9}}
    29: {{1,3}}        113: {{1,2,3}}          203: {{1,1},{1,3}}
    37: {{1,1,2}}      131: {{1,1,1,1,1}}      223: {{1,1,1,1,2}}
    43: {{1,4}}        133: {{1,1},{1,1,1}}    227: {{4,4}}
    47: {{2,3}}        137: {{2,5}}            229: {{1,3,3}}
    53: {{1,1,1,1}}    139: {{1,7}}            233: {{2,7}}
    61: {{1,2,2}}      149: {{3,4}}            239: {{1,1,6}}
    71: {{1,1,3}}      151: {{1,1,2,2}}        247: {{1,2},{1,1,1}}
    73: {{2,4}}        161: {{1,1},{2,2}}      251: {{1,2,2,2}}
    79: {{1,5}}        163: {{1,8}}            257: {{3,5}}
    89: {{1,1,1,2}}    167: {{2,6}}            259: {{1,1},{1,1,2}}
		

Crossrefs

These primes (of nonprime index) are listed by A007821.
The non-strict version is A320629, with not necessarily odd version A320628.
The not necessarily odd version is A340104.
The prime instead of odd nonprime version:
primes: A006450
products: A076610
strict: A302590
The squarefree semiprime instead of odd nonprime version:
strict: A309356
primes: A322551
products: A339113
The semiprime instead of odd nonprime version:
primes: A106349
products: A339112
strict: A340020
A001358 lists semiprimes.
A056239 gives the sum of prime indices, which are listed by A112798.
A257994 counts prime prime indices.
A302242 is the weight of the multiset of multisets with MM-number n.
A305079 is the number of connected components for MM-number n.
A330944 counts nonprime prime indices.
A330945 lists numbers with a nonprime prime index (nonprime case: A330948).
A339561 lists products of distinct squarefree 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

  • Mathematica
    Select[Range[1,100,2],SquareFreeQ[#]&&FreeQ[If[#==1,{},FactorInteger[#]],{p_,k_}/;PrimeQ[PrimePi[p]]]&]

Formula

Previous Showing 21-30 of 36 results. Next