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 31-40 of 40 results.

A371448 Numbers such that (1) the product of prime indices is squarefree, and (2) the binary indices of prime indices cover an initial interval of positive integers.

Original entry on oeis.org

1, 2, 4, 5, 6, 8, 10, 12, 15, 16, 17, 20, 24, 26, 30, 32, 33, 34, 40, 47, 48, 51, 52, 55, 60, 64, 66, 68, 80, 85, 86, 94, 96, 102, 104, 110, 120, 123, 127, 128, 132, 136, 141, 143, 160, 165, 170, 172, 187, 188, 192, 204, 205, 208, 215, 220, 221, 226, 240, 246
Offset: 1

Views

Author

Gus Wiseman, Mar 31 2024

Keywords

Comments

Also Heinz numbers of integer partitions whose parts have (1) squarefree product and (2) binary indices covering an initial interval.
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.
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 terms together with their binary indices of prime indices begin:
   1: {}
   2: {{1}}
   4: {{1},{1}}
   5: {{1,2}}
   6: {{1},{2}}
   8: {{1},{1},{1}}
  10: {{1},{1,2}}
  12: {{1},{1},{2}}
  15: {{2},{1,2}}
  16: {{1},{1},{1},{1}}
  17: {{1,2,3}}
  20: {{1},{1},{1,2}}
  24: {{1},{1},{1},{2}}
  26: {{1},{2,3}}
  30: {{1},{2},{1,2}}
  32: {{1},{1},{1},{1},{1}}
  33: {{2},{1,3}}
  34: {{1},{1,2,3}}
  40: {{1},{1},{1},{1,2}}
  47: {{1,2,3,4}}
  48: {{1},{1},{1},{1},{2}}
  51: {{2},{1,2,3}}
		

Crossrefs

An opposite version is A371293, A371292.
Without the squarefree condition we have A371447, see also A320456, A326754.
The connected components of this multiset system are counted by A371451.
A000009 counts partitions covering initial interval, compositions A107429.
A000670 counts patterns, ranked by A333217.
A011782 counts multisets covering an initial interval.
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.
A131689 counts patterns by number of distinct parts.

Programs

  • Mathematica
    normQ[m_]:=Or[m=={},Union[m]==Range[Max[m]]];
    bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n], {p_,k_}:>Table[PrimePi[p],{k}]]]];
    Select[Range[1000], SquareFreeQ[Times@@prix[#]]&&normQ[Join@@bpe/@prix[#]]&]

Formula

Intersection of A302505 and A371447.

A319496 Numbers whose prime indices are distinct and pairwise indivisible and whose own prime indices are connected and span an initial interval of positive integers.

Original entry on oeis.org

2, 3, 7, 13, 19, 37, 53, 61, 89, 91, 113, 131, 151, 223, 247, 251, 281, 299, 311, 359, 377, 427, 463, 503, 593, 611, 659, 689, 703, 719, 791, 827, 851, 863, 923, 953, 1069, 1073, 1159, 1163, 1291, 1321, 1339, 1363, 1511, 1619, 1703, 1733, 1739, 1757, 1769
Offset: 1

Views

Author

Gus Wiseman, Dec 16 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}}. This sequence lists all MM-numbers of connected strict antichains of multisets spanning an initial interval of positive integers.

Examples

			The sequence of multisystems whose MM-numbers belong to the sequence begins:
    2: {{}}
    3: {{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}}
  151: {{1,1,2,2}}
  223: {{1,1,1,1,2}}
  247: {{1,2},{1,1,1}}
  251: {{1,2,2,2}}
  281: {{1,1,2,3}}
  299: {{1,2},{2,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]];
    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]]]]]]]]];
    stableQ[u_,Q_]:=!Apply[Or,Outer[#1=!=#2&&Q[#1,#2]&,u,u,1],{0,1}];
    Select[Range[200],And[SquareFreeQ[#],normQ[primeMS/@primeMS[#]],stableQ[primeMS[#],Divisible],Length[zsm[primeMS[#]]]==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&]]}]

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

A318401 Numbers whose prime indices are distinct and pairwise indivisible and whose own prime indices span an initial interval of positive integers.

Original entry on oeis.org

1, 2, 3, 7, 13, 15, 19, 35, 37, 53, 61, 69, 89, 91, 95, 113, 131, 141, 143, 145, 151, 161, 165, 223, 247, 251, 265, 281, 299, 309, 311, 329, 355, 359, 377, 385, 407, 427, 437, 463, 503, 591, 593, 611, 655, 659, 667, 671, 689, 703, 719, 721, 759, 791, 827, 851
Offset: 1

Views

Author

Gus Wiseman, Dec 16 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}}. This sequence lists all MM-numbers of strict antichains of multisets spanning an initial interval of positive integers.

Examples

			The sequence of multisystems whose MM-numbers belong to the sequence begins:
   1: {}
   2: {{}}
   3: {{1}}
   7: {{1,1}}
  13: {{1,2}}
  15: {{1},{2}}
  19: {{1,1,1}}
  35: {{2},{1,1}}
  37: {{1,1,2}}
  53: {{1,1,1,1}}
  61: {{1,2,2}}
  69: {{1},{2,2}}
  89: {{1,1,1,2}}
  91: {{1,1},{1,2}}
  95: {{2},{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]];
    stableQ[u_,Q_]:=!Apply[Or,Outer[#1=!=#2&&Q[#1,#2]&,u,u,1],{0,1}];
    Select[Range[200],And[SquareFreeQ[#],normQ[primeMS/@primeMS[#]],stableQ[primeMS[#],Divisible]]&]

A320634 Odd numbers whose multiset multisystem is a multiset partition spanning an initial interval of positive integers (odd = no empty sets).

Original entry on oeis.org

1, 3, 7, 9, 13, 15, 19, 21, 27, 35, 37, 39, 45, 49, 53, 57, 61, 63, 65, 69, 75, 81, 89, 91, 95, 105, 111, 113, 117, 131, 133, 135, 141, 143, 145, 147, 151, 159, 161, 165, 169, 171, 175, 183, 185, 189, 195, 207, 223, 225, 243, 245, 247, 251, 259, 265, 267, 273
Offset: 1

Views

Author

Gus Wiseman, Oct 18 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 n-th multiset multisystem 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 78th multiset multisystem is {{},{1},{1,2}}.

Examples

			The sequence of terms together with their multiset multisystems begins:
    1: {}
    3: {{1}}
    7: {{1,1}}
    9: {{1},{1}}
   13: {{1,2}}
   15: {{1},{2}}
   19: {{1,1,1}}
   21: {{1},{1,1}}
   27: {{1},{1},{1}}
   35: {{2},{1,1}}
   37: {{1,1,2}}
   39: {{1},{1,2}}
   45: {{1},{1},{2}}
   49: {{1,1},{1,1}}
   53: {{1,1,1,1}}
   57: {{1},{1,1,1}}
   61: {{1,2,2}}
   63: {{1},{1},{1,1}}
   65: {{2},{1,2}}
   69: {{1},{2,2}}
   75: {{1},{2},{2}}
   81: {{1},{1},{1},{1}}
   89: {{1,1,1,2}}
   91: {{1,1},{1,2}}
   95: {{2},{1,1,1}}
  105: {{1},{2},{1,1}}
  111: {{1},{1,1,2}}
  113: {{1,2,3}}
  117: {{1},{1},{1,2}}
  131: {{1,1,1,1,1}}
  133: {{1,1},{1,1,1}}
  135: {{1},{1},{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[1,100,2],normQ[primeMS/@primeMS[#]]&]

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

Original entry on oeis.org

13, 377, 611, 1363, 16211, 17719, 26273, 27521, 44603, 56173, 58609, 83291, 91031, 91039, 99499, 141401, 147533, 203087, 301129, 315433, 467711, 761917, 1183403, 1280669, 1293487, 1917929, 2075567, 2174159, 2220907, 2415439, 2640131
Offset: 1

Views

Author

Gus Wiseman, Oct 18 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:
       13: {{1,2}}
      377: {{1,2},{1,3}}
      611: {{1,2},{2,3}}
     1363: {{1,3},{2,3}}
    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}}
   141401: {{1,2},{2,4},{3,4}}
   147533: {{1,4},{2,3},{2,4}}
   203087: {{1,3},{2,3},{3,4}}
   301129: {{1,4},{2,3},{3,4}}
   315433: {{1,3},{2,4},{3,4}}
   467711: {{1,4},{2,4},{3,4}}
   761917: {{1,2},{1,3},{1,4},{2,3}}
  1183403: {{1,2},{1,3},{1,4},{2,4}}
  1280669: {{1,2},{1,3},{1,4},{1,5}}
		

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]];
    zsm[s_]:=With[{c=Select[Tuples[Range[Length[s]],2],And[Less@@#,GCD@@s[[#]]]>1&]},If[c=={},s,zsm[Union[Append[Delete[s,List/@c[[1]]],LCM@@s[[c[[1]]]]]]]]];
    Select[Range[10000],And[SquareFreeQ[#],normQ[primeMS/@primeMS[#]],And@@(And[SquareFreeQ[#],Length[primeMS[#]]==2]&/@primeMS[#]),Length[zsm[primeMS[#]]]==1]&]
Previous Showing 31-40 of 40 results.