A325706 -id:A325706 - cp's OEIS frontend

A327473 Heinz numbers of integer partitions whose mean A326567/A326568 is a part.

2, 3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 19, 23, 25, 27, 29, 30, 31, 32, 37, 41, 43, 47, 49, 53, 59, 61, 64, 67, 71, 73, 79, 81, 83, 84, 89, 90, 97, 101, 103, 105, 107, 109, 110, 113, 121, 125, 127, 128, 131, 137, 139, 149, 151, 157, 163, 167, 169, 173, 179, 181

Offset: 1

Gus Wiseman, Sep 13 2019

nonn

The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).

			The sequence of terms together with their prime indices begins:
   2: {1}
   3: {2}
   4: {1,1}
   5: {3}
   7: {4}
   8: {1,1,1}
   9: {2,2}
  11: {5}
  13: {6}
  16: {1,1,1,1}
  17: {7}
  19: {8}
  23: {9}
  25: {3,3}
  27: {2,2,2}
  29: {10}
  30: {1,2,3}
  31: {11}
  32: {1,1,1,1,1}
  37: {12}

A subsequence of A316413.
Complement of A327476.
The enumeration of these partitions by sum is given by A237984.
Subsets whose mean is a part are A065795.
Numbers whose binary indices include their mean are A327478.
Cf. A000016, A056239, A067538, A112798, A240850, A325706, A326567/A326568.

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

A325755 Numbers n divisible by their prime shadow A181819(n).

Original entry on oeis.org

1, 2, 9, 12, 18, 36, 40, 60, 84, 112, 120, 125, 132, 156, 180, 204, 225, 228, 250, 252, 276, 280, 336, 348, 352, 360, 372, 396, 440, 441, 444, 450, 468, 492, 516, 520, 540, 560, 564, 600, 612, 636, 675, 680, 684, 708, 732, 760, 804, 828, 832, 840, 852, 876

Offset: 1

Gus Wiseman, May 19 2019

nonn

We define the prime shadow A181819(n) to be the product of primes indexed by the exponents in the prime factorization of n. For example, 90 = prime(1)*prime(2)^2*prime(3) has prime shadow prime(1)*prime(2)*prime(1) = 12.

The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k), so these are Heinz numbers of integer partitions containing their multiset of multiplicities as a submultiset (counted by A325702).

			The sequence of terms together with their prime indices begins:
     1: {}
     2: {1}
     9: {2,2}
    12: {1,1,2}
    18: {1,2,2}
    36: {1,1,2,2}
    40: {1,1,1,3}
    60: {1,1,2,3}
    84: {1,1,2,4}
   112: {1,1,1,1,4}
   120: {1,1,1,2,3}
   125: {3,3,3}
   132: {1,1,2,5}
   156: {1,1,2,6}
   180: {1,1,2,2,3}
   204: {1,1,2,7}
   225: {2,2,3,3}
   228: {1,1,2,8}
   250: {1,3,3,3}
   252: {1,1,2,2,4}

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A181819, A182857, A290689, A290822, A323014, A324843, A325702, A325706, A325708, A325756.

red[n_]:=If[n==1,1,Times@@Prime/@Last/@FactorInteger[n]];
Select[Range[100],Divisible[#,red[#]]&]

A325705 Number of integer partitions of n containing all of their distinct multiplicities.

Original entry on oeis.org

1, 1, 0, 1, 3, 2, 4, 3, 7, 8, 16, 15, 24, 28, 39, 44, 68, 80, 98, 130, 167, 200, 259, 320, 396, 497, 601, 737, 910, 1107, 1335, 1631, 1983, 2372, 2887, 3439, 4166, 4949, 5940, 7043, 8450, 9980, 11884, 13984, 16679, 19493, 23162, 27050, 31937, 37334, 43926

Offset: 0

Gus Wiseman, May 18 2019

nonn

The Heinz numbers of these partitions are given by A325706.

			The partition (4,2,1,1,1,1) has distinct multiplicities {1,4}, both of which belong to the partition, so it is counted under a(10).
The a(0) = 1 through a(10) = 16 partitions:
  ()  (1)  (21)  (22)   (41)   (51)    (61)    (71)     (81)     (91)
                 (31)   (221)  (321)   (421)   (431)    (333)    (541)
                 (211)         (2211)  (3211)  (521)    (531)    (631)
                               (3111)          (3221)   (621)    (721)
                                               (4211)   (3321)   (3322)
                                               (32111)  (4221)   (3331)
                                               (41111)  (5211)   (4321)
                                                        (32211)  (5221)
                                                                 (6211)
                                                                 (32221)
                                                                 (33211)
                                                                 (42211)
                                                                 (43111)
                                                                 (322111)
                                                                 (421111)
                                                                 (511111)

Cf. A109297, A114639, A114640, A181819, A225486, A290689, A324753, A324843, A325702, A325706, A325707, A325755.

Table[Length[Select[IntegerPartitions[n],SubsetQ[Sort[#],Sort[Length/@Split[#]]]&]],{n,0,30}]

A325756 A number k belongs to the sequence if k = 1 or k is divisible by its prime shadow A181819(k) and the quotient k/A181819(k) also belongs to the sequence.

Original entry on oeis.org

1, 2, 12, 336, 360, 45696, 52416, 75600, 22665216, 31804416, 42928704, 77792400, 92610000, 164656800, 174636000

Offset: 1

Gus Wiseman, May 19 2019

We define the prime shadow A181819(k) to be the product of primes indexed by the exponents in the prime factorization of n. For example, 90 = prime(1)*prime(2)^2*prime(3) has prime shadow prime(1)*prime(2)*prime(1) = 12.

			The sequence of terms together with their prime indices begins:
      1: {}
      2: {1}
     12: {1,1,2}
    336: {1,1,1,1,2,4}
    360: {1,1,1,2,2,3}
  45696: {1,1,1,1,1,1,1,2,4,7}
  52416: {1,1,1,1,1,1,2,2,4,6}
  75600: {1,1,1,1,2,2,2,3,3,4}

Cf. A181819, A182857, A290689, A290822, A323014, A324843, A325702, A325706, A325708, A325755.

red[n_] := If[n == 1, 1, Times @@ Prime /@ Last /@ FactorInteger[n]];
suQ[n_]:=n==1||Divisible[n,red[n]]&&suQ[n/red[n]];
Select[Range[10000],suQ]

ps(n) = my(f=factor(n)); prod(k=1, #f~, prime(f[k, 2])); \\ A181819
isok(k) = {if ((k==1), return(1)); my(p=ps(k)); ((k % p) == 0) && isok(k/p);} \\ Michel Marcus, Jan 09 2021

a(9)-a(15) from Amiram Eldar, Jan 09 2021

A325708 Numbers n whose prime indices cover an initial interval of positive integers and include all prime exponents of n.

Original entry on oeis.org

1, 2, 6, 12, 18, 30, 36, 60, 90, 120, 150, 180, 210, 270, 300, 360, 420, 450, 540, 600, 630, 750, 840, 900, 1050, 1080, 1260, 1350, 1470, 1500, 1680, 1800, 1890, 2100, 2250, 2310, 2520, 2700, 2940, 3000, 3150, 3780, 4200, 4410, 4500, 4620, 5040, 5250, 5400

Offset: 1

Gus Wiseman, May 18 2019

nonn

The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k), so these are Heinz numbers of integer partitions covering an initial interval of positive integers and containing all of their distinct multiplicities. The enumeration of these partitions by sum is given by A325707.

			The sequence of terms together with their prime indices begins:
     1: {}
     2: {1}
     6: {1,2}
    12: {1,1,2}
    18: {1,2,2}
    30: {1,2,3}
    36: {1,1,2,2}
    60: {1,1,2,3}
    90: {1,2,2,3}
   120: {1,1,1,2,3}
   150: {1,2,3,3}
   180: {1,1,2,2,3}
   210: {1,2,3,4}
   270: {1,2,2,2,3}
   300: {1,1,2,3,3}
   360: {1,1,1,2,2,3}
   420: {1,1,2,3,4}
   450: {1,2,2,3,3}
   540: {1,1,2,2,2,3}
   600: {1,1,1,2,3,3}

Cf. A055932, A109297, A114639, A114640, A181819, A290689, A290822, A325705, A325706, A325707.

Select[Range[1000],#==1||Range[PrimeNu[#]]==PrimePi/@First/@FactorInteger[#]&&SubsetQ[PrimePi/@First/@FactorInteger[#],Last/@FactorInteger[#]]&]

A325707 Number of integer partitions of n covering an initial interval of positive integers and containing all of their distinct multiplicities.

Original entry on oeis.org

1, 1, 0, 1, 1, 1, 2, 1, 2, 2, 4, 4, 5, 6, 7, 8, 10, 11, 13, 16, 18, 23, 26, 32, 36, 43, 48, 57, 64, 74, 84, 98, 110, 127, 145, 165, 189, 215, 244, 277, 316, 356, 403, 455, 513, 577, 650, 727, 817, 913, 1024, 1143, 1279, 1425, 1592, 1773, 1977, 2198, 2448, 2717

Offset: 0

Gus Wiseman, May 18 2019

nonn

The Heinz numbers of these partitions are given by A325708.

			The initial terms count the following partitions:
   1: (1)
   3: (21)
   4: (211)
   5: (221)
   6: (321)
   6: (2211)
   7: (3211)
   8: (3221)
   8: (32111)
   9: (3321)
   9: (32211)
  10: (4321)
  10: (33211)
  10: (32221)
  10: (322111)
  11: (43211)
  11: (33221)
  11: (332111)
  11: (322211)
  12: (43221)
  12: (432111)
  12: (33321)
  12: (332211)
  12: (3222111)

Cf. A000009 (partitions covering an initial interval), A055932, A109297, A114639, A114640, A290689, A324753, A325702, A325706, A325708.

Table[Length[Select[IntegerPartitions[n],Range[Length[Union[#]]]==Union[#]&&SubsetQ[Sort[#],Sort[Length/@Split[#]]]&]],{n,0,30}]

A325766 Number of integer partitions of n covering an initial interval of positive integers and containing their own multiset of multiplicities (as a submultiset).

Original entry on oeis.org

1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 3, 1, 5, 4, 5, 4, 6, 7, 8, 6, 12, 11, 19, 16, 22, 22, 25, 32, 38, 45, 45, 51, 53, 71, 69, 85, 92, 118, 125, 147, 149, 184, 187, 230, 254, 290, 317, 372, 397, 449, 502, 544, 616, 680, 758, 841, 930, 1042, 1151, 1262

Offset: 0

Gus Wiseman, May 19 2019

nonn

The Heinz numbers of these partitions are given by A325767.

			The initial terms count the following partitions:
   1: (1)
   4: (2,1,1)
   5: (2,2,1)
   6: (2,2,1,1)
   7: (3,2,1,1)
   8: (3,2,1,1,1)
   9: (3,2,2,1,1)
  10: (3,2,2,1,1,1)
  11: (3,3,2,2,1)
  11: (3,3,2,1,1,1)
  11: (3,2,2,2,1,1)
  12: (4,3,2,1,1,1)
  13: (4,3,2,2,1,1)
  13: (4,3,2,1,1,1,1)
  13: (3,3,3,2,1,1)
  13: (3,3,2,2,2,1)
  13: (3,3,2,2,1,1,1)
  14: (4,3,2,2,1,1,1)
  14: (3,3,3,2,2,1)
  14: (3,3,3,2,1,1,1)
  14: (3,3,2,2,2,1,1)

Cf. A000009 (partitions covering an initial interval), A055932, A114639, A114640, A290689, A324753, A325702, A325706, A325707, A325708, A325767.

submultQ[cap_,fat_]:=And@@Function[i,Count[fat,i]>=Count[cap,i]]/@Union[List@@cap]
Table[Length[Select[IntegerPartitions[n],Range[Length[Union[#]]]==Union[#]&&submultQ[Sort[Length/@Split[#]],Sort[#]]&]],{n,0,30}]

cp's OEIS Frontend

A327473 Heinz numbers of integer partitions whose mean A326567/A326568 is a part.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A325755 Numbers n divisible by their prime shadow A181819(n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A325705 Number of integer partitions of n containing all of their distinct multiplicities.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A325756 A number k belongs to the sequence if k = 1 or k is divisible by its prime shadow A181819(k) and the quotient k/A181819(k) also belongs to the sequence.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

PARI

Extensions

A325708 Numbers n whose prime indices cover an initial interval of positive integers and include all prime exponents of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A325707 Number of integer partitions of n covering an initial interval of positive integers and containing all of their distinct multiplicities.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A325766 Number of integer partitions of n covering an initial interval of positive integers and containing their own multiset of multiplicities (as a submultiset).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica