A322527 -id:A322527 - cp's OEIS frontend

A319899 Numbers whose number of prime factors with multiplicity (A001222) is the number of distinct prime factors (A001221) in the product of the prime indices (A003963).

1, 3, 5, 7, 11, 15, 17, 19, 23, 26, 31, 33, 35, 39, 41, 51, 53, 55, 58, 59, 65, 67, 69, 74, 77, 83, 85, 86, 87, 91, 93, 94, 95, 97, 103, 109, 111, 119, 122, 123, 127, 129, 131, 142, 146, 155, 157, 158, 161, 165, 169, 177, 178, 179, 183, 185, 187, 191, 201, 202

Offset: 1

Gus Wiseman, Dec 17 2018

nonn

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 square multiset multisystems, meaning the number of edges is equal to the number of distinct vertices.

			The sequence of multiset multisystems whose MM-numbers belong to the sequence begins:
   1: {}
   3: {{1}}
   5: {{2}}
   7: {{1,1}}
  11: {{3}}
  15: {{1},{2}}
  17: {{4}}
  19: {{1,1,1}}
  23: {{2,2}}
  26: {{},{1,2}}
  31: {{5}}
  33: {{1},{3}}
  35: {{2},{1,1}}
  39: {{1},{1,2}}
  41: {{6}}
  51: {{1},{4}}
  53: {{1,1,1,1}}
  55: {{2},{3}}
  58: {{},{1,3}}
  59: {{7}}
  65: {{2},{1,2}}
  67: {{8}}
  69: {{1},{2,2}}
  74: {{},{1,1,2}}

Cf. A003963, A057151, A064573, A120732, A319616, A319877, A320325, A322527, A322530.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],PrimeOmega[#]==PrimeNu[Times@@primeMS[#]]&]

A322526 Number of integer partitions of n whose product of parts is a squarefree number.

Original entry on oeis.org

1, 1, 2, 3, 3, 5, 6, 8, 9, 10, 13, 15, 17, 21, 24, 27, 30, 36, 41, 46, 51, 57, 65, 73, 82, 90, 101, 109, 121, 134, 150, 164, 177, 193, 214, 232, 253, 278, 300, 324, 351, 386, 419, 452, 484, 521, 563, 610, 658, 706, 758, 809, 868, 938, 1006, 1071, 1140, 1220, 1307

Offset: 0

Gus Wiseman, Dec 14 2018

nonn

The parts of such a partition must also be squarefree and distinct except for any number of 1's.

			The a(8) = 9 partitions are (53), (71), (521), (611), (5111), (32111), (311111), (2111111), (11111111). Missing from this list are (8), (62), (44), (431), (422), (4211), (41111), (332), (3311), (3221), (2222), (22211), (221111).

Partial sums of A322530.

Cf. A001055, A003963, A005117, A064573 , A073576, A096276, A301987, A302505, A319005, A319916, A320322, A322527, A322529, A322531.

Table[Length[Select[IntegerPartitions[n],SquareFreeQ[Times@@#]&]],{n,30}]

A322530 Number of integer partitions of n with no 1's whose product of parts is a squarefree number.

Original entry on oeis.org

1, 0, 1, 1, 0, 2, 1, 2, 1, 1, 3, 2, 2, 4, 3, 3, 3, 6, 5, 5, 5, 6, 8, 8, 9, 8, 11, 8, 12, 13, 16, 14, 13, 16, 21, 18, 21, 25, 22, 24, 27, 35, 33, 33, 32, 37, 42, 47, 48, 48, 52, 51, 59, 70, 68, 65, 69, 80, 87, 90, 103, 100, 96, 103, 123, 128, 135, 136, 132, 153

Offset: 0

Gus Wiseman, Dec 14 2018

nonn

Such a partition must be strict and its parts must also be squarefree.

			The a(26) = 11 integer partitions:
  (26),
  (15,11), (19,7), (21,5), (23,3),
  (13,7,6), (13,10,3), (13,11,2), (17,7,2), (19,5,2),
  (11,7,5,3).

First differences of A322526.

Cf. A002865, A003963, A005117, A064573, A072774, A073576, A302505, A319005, A319057, A319169, A320322, A322527, A322528, A322529.

Table[Length[Select[IntegerPartitions[n],!MemberQ[#,1]&&SquareFreeQ[Times@@#]&]],{n,30}]

A322528 Number of integer partitions of n whose parts all have the same number of prime factors (counted with multiplicity) and whose product of parts is a power of a squarefree number (A072774).

Original entry on oeis.org

1, 1, 2, 2, 3, 3, 4, 3, 5, 4, 7, 2, 7, 4, 7, 7, 9, 3, 10, 5, 12, 9, 8, 6, 14, 10, 12, 10, 14, 11, 20, 13, 18, 13, 16, 16, 25, 16, 19, 20, 26, 18, 30, 19, 27, 26, 27, 22, 38, 30, 37, 28, 38, 32, 43, 37, 46, 40, 47, 40, 66, 49, 58, 56, 64, 56, 73, 58, 76, 70, 85

Offset: 0

Gus Wiseman, Dec 14 2018

nonn

			The a(1) = 1 through a(8) = 5 integer partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (111)  (22)    (32)     (33)      (52)       (44)
                    (1111)  (11111)  (222)     (1111111)  (53)
                                     (111111)             (2222)
                                                          (11111111)

Cf. A002865, A003963, A005117, A064573 , A072774, A295193, A302505, A306017, A319169, A320322, A322526, A322527, A322529, A322530, A322531.

Table[Length[Select[IntegerPartitions[n],And[SameQ@@PrimeOmega/@#,SameQ@@Last/@FactorInteger[Times@@#]]&]],{n,30}]

More terms from Alois P. Heinz, Dec 14 2018

A322529 Number of integer partitions of n whose parts all have the same number of prime factors (counted with or without multiplicity) and whose product of parts is a squarefree number.

Original entry on oeis.org

1, 1, 2, 2, 1, 3, 2, 3, 2, 2, 4, 2, 3, 3, 4, 4, 4, 3, 5, 4, 5, 6, 6, 6, 6, 6, 8, 6, 7, 9, 8, 11, 8, 11, 11, 11, 12, 13, 13, 15, 13, 17, 17, 18, 18, 17, 20, 22, 21, 24, 24, 24, 26, 29, 28, 33, 30, 35, 34, 38, 38, 45, 42, 43, 45, 48, 52, 54, 55, 59, 59, 65, 65, 72, 73

Offset: 0

Gus Wiseman, Dec 14 2018

nonn

Such a partition must be strict (unless it is all 1's) and its parts must also be squarefree.

			The a(30) = 8 integer partitions:
  (30),
  (17,13),(19,11),(23,7),
  (17,11,2),(23,5,2),
  (13,7,5,3,2),
  (1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1).

Lucas A. Brown, Table of n, a(n) for n = 0..133
Lucas A. Brown, Python program.

Cf. A002865, A003963, A005117, A038041, A064573, A073576, A302505, A319056, A320322, A321717, A321718, A322526, A322527, A322528, A322530, A322531.

Table[Length[Select[IntegerPartitions[n],And[SameQ@@PrimeOmega/@#,SquareFreeQ[Times@@#]]&]],{n,30}]

a(51)-a(69) from Jinyuan Wang, Jun 27 2020

a(70) onwards from Lucas A. Brown, Aug 17 2024

A319877 Numbers whose product of prime indices (A003963) is a square of a squarefree number (A062503).

Original entry on oeis.org

1, 7, 9, 14, 18, 23, 25, 28, 36, 46, 50, 56, 72, 92, 97, 100, 112, 121, 144, 151, 161, 169, 175, 183, 184, 185, 194, 195, 200, 207, 224, 225, 227, 242, 288, 289, 302, 322, 338, 350, 366, 368, 370, 388, 390, 400, 414, 448, 450, 454, 484, 541, 576, 578, 604, 644

Offset: 1

Gus Wiseman, Dec 17 2018

nonn

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 2-regular multiset multisystems (meaning all vertex-degrees are 2).

			The sequence of multiset multisystems whose MM-numbers belong to the sequence begins:
    1: {}
    7: {{1,1}}
    9: {{1},{1}}
   14: {{},{1,1}}
   18: {{},{1},{1}}
   23: {{2,2}}
   25: {{2},{2}}
   28: {{},{},{1,1}}
   36: {{},{},{1},{1}}
   46: {{},{2,2}}
   50: {{},{2},{2}}
   56: {{},{},{},{1,1}}
   72: {{},{},{},{1},{1}}
   92: {{},{},{2,2}}
   97: {{3,3}}
  100: {{},{},{2},{2}}
  112: {{},{},{},{},{1,1}}
  121: {{3},{3}}
  144: {{},{},{},{},{1},{1}}
  151: {{1,1,2,2}}
  161: {{1,1},{2,2}}
  169: {{1,2},{1,2}}
  175: {{2},{2},{1,1}}
  183: {{1},{1,2,2}}
  184: {{},{},{},{2,2}}
  185: {{2},{1,1,2}}
  194: {{},{3,3}}
  195: {{1},{2},{1,2}}
  200: {{},{},{},{2},{2}}

Cf. A003963, A005117, A005176, A062503, A064573, A072774, A295193, A302505, A319878, A319899, A320325, A322526, A322527, A322530.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],Or[#==1,SameQ[##,2]&@@Last/@FactorInteger[Times@@primeMS[#]]]&]

A319878 Odd numbers whose product of prime indices (A003963) is a square of a squarefree number (A062503).

Original entry on oeis.org

1, 7, 9, 23, 25, 97, 121, 151, 161, 169, 175, 183, 185, 195, 207, 225, 227, 289, 541, 661, 679, 687, 781, 841, 847, 873, 957, 961, 1009, 1089, 1193, 1427, 1563, 1589, 1681, 1819, 1849, 1879, 1895, 2023, 2043, 2167, 2193, 2209, 2231, 2425, 2437, 2585, 2601

Offset: 1

Gus Wiseman, Dec 17 2018

nonn

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 2-regular (all vertex-degrees are 2) multiset partitions (no empty parts).

			The sequence of multiset partitions whose MM-numbers belong to the sequence begins:
    1: {}
    7: {{1,1}}
    9: {{1},{1}}
   23: {{2,2}}
   25: {{2},{2}}
   97: {{3,3}}
  121: {{3},{3}}
  151: {{1,1,2,2}}
  161: {{1,1},{2,2}}
  169: {{1,2},{1,2}}
  175: {{2},{2},{1,1}}
  183: {{1},{1,2,2}}
  185: {{2},{1,1,2}}
  195: {{1},{2},{1,2}}
  207: {{1},{1},{2,2}}
  225: {{1},{1},{2},{2}}
  227: {{4,4}}
  289: {{4},{4}}
  541: {{1,1,3,3}}
  661: {{5,5}}
  679: {{1,1},{3,3}}
  687: {{1},{1,3,3}}
  781: {{3},{1,1,3}}
  841: {{1,3},{1,3}}
  847: {{1,1},{3},{3}}
  873: {{1},{1},{3,3}}
  957: {{1},{3},{1,3}}
  961: {{5},{5}}

Cf. A003963, A005117, A005176, A062503, A064573, A072774, A295193, A302505, A319877, A319899, A320325, A322526, A322527, A322530.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[1,100,2],Or[#==1,SameQ[##,2]&@@Last/@FactorInteger[Times@@primeMS[#]]]&]

cp's OEIS Frontend

A319899 Numbers whose number of prime factors with multiplicity (A001222) is the number of distinct prime factors (A001221) in the product of the prime indices (A003963).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A322526 Number of integer partitions of n whose product of parts is a squarefree number.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A322530 Number of integer partitions of n with no 1's whose product of parts is a squarefree number.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A322528 Number of integer partitions of n whose parts all have the same number of prime factors (counted with multiplicity) and whose product of parts is a power of a squarefree number (A072774).

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Extensions

A322529 Number of integer partitions of n whose parts all have the same number of prime factors (counted with or without multiplicity) and whose product of parts is a squarefree number.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A319877 Numbers whose product of prime indices (A003963) is a square of a squarefree number (A062503).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A319878 Odd numbers whose product of prime indices (A003963) is a square of a squarefree number (A062503).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica