A052335 -id:A052335 - cp's OEIS frontend

A387177 Numbers whose prime indices have choosable sets of strict integer partitions. Positions of nonzero terms in A387115.

1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 25, 26, 29, 30, 31, 33, 34, 35, 37, 38, 39, 41, 42, 43, 46, 47, 49, 50, 51, 53, 55, 57, 58, 59, 61, 62, 65, 66, 67, 69, 70, 71, 73, 74, 75, 77, 78, 79, 82, 83, 85, 86, 87, 89, 91, 93, 94, 95, 97, 98

Offset: 1

Gus Wiseman, Aug 29 2025

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.

We say that a sequence of nonempty sets is choosable iff it is possible to choose a different element from each set. For example, ({1,2},{1},{1,3}) is choosable because we have the choice (2,1,3), but ({1},{2},{1,3},{2,3}) is not.

			The prime indices of 50 are {1,3,3}, and {(1),(3),(2,1)} is a valid choice of distinct strict partitions, so 50 is in the sequence.

The version for all partitions appears to be A276078, counted by A052335.
The complement for all partitions appears to be A276079, counted by A387134.
The complement for divisors is A355740, counted by A370320.
Twice-partitions of this type (into distinct strict partitions) are counted by A358914.
The version for divisors is A368110, counted by A239312.
The version for initial intervals is A387112, counted by A238873, see A387111.
The complement for initial intervals is A387113, counted by A387118.
These are the positions of nonzero terms in A387115.
The complement is A387176.
Partitions of this type are counted by A387178, complement A387137.
The complement for constant partitions is A387180, counted by A387329, see A387120.
The version for constant partitions is A387181, counted by A387330.
A000041 counts integer partitions, strict A000009.
A003963 multiplies together the prime indices of n.
A112798 lists prime indices, row sums A056239 or A066328, lengths A001222.
A289509 lists numbers with relatively prime prime indices.
Cf. A000720, A120383, A270995, A299200, A335433, A335448, A357978, A357982, A383706, A387110.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
strptns[n_]:=Select[IntegerPartitions[n],UnsameQ@@#&];
Select[Range[100],Select[Tuples[strptns/@prix[#]],UnsameQ@@#&]!={}&]

A387178 Number of integer partitions of n whose parts have choosable sets of strict integer partitions.

Original entry on oeis.org

1, 1, 1, 2, 2, 3, 5, 6, 8, 10, 13, 17, 21, 27, 34, 42, 53, 65, 80, 98, 119, 146, 177, 213, 258, 309, 370, 443, 528, 628, 745, 882, 1043, 1229, 1447, 1700, 1993, 2333, 2727, 3182, 3707, 4311, 5008, 5808, 6727, 7782, 8990, 10371, 11952, 13756, 15815, 18161

Offset: 0

Gus Wiseman, Sep 02 2025

First differs from A052337 in having 745 instead of 746.
We say that a sequence of nonempty sets is choosable iff it is possible to choose a different element from each set. For example, ({1,2},{1},{1,3}) is choosable because we have the choice (2,1,3), but ({1},{2},{1,3},{2,3}) is not.
a(n) is the number of integer partitions of n such that it is possible to choose a sequence of distinct strict integer partitions of each part.
Also the number of integer partitions of n with no part k whose multiplicity exceeds A000009(k).

			The partition y = (3,3,2) has sets of strict integer partitions ({(2,1),(3)},{(2,1),(3)},{(2)}), and we have the choice ((2,1),(3),(2)) or ((3),(2,1),(2)), so y is counted under a(8).
The a(1) = 1 through a(9) = 10 partitions:
  (1)  (2)  (3)    (4)    (5)    (6)      (7)      (8)      (9)
            (2,1)  (3,1)  (3,2)  (3,3)    (4,3)    (4,4)    (5,4)
                          (4,1)  (4,2)    (5,2)    (5,3)    (6,3)
                                 (5,1)    (6,1)    (6,2)    (7,2)
                                 (3,2,1)  (3,3,1)  (7,1)    (8,1)
                                          (4,2,1)  (3,3,2)  (4,3,2)
                                                   (4,3,1)  (4,4,1)
                                                   (5,2,1)  (5,3,1)
                                                            (6,2,1)
                                                            (3,3,2,1)

For initial intervals instead of strict partitions we have A238873, ranks A387112.
For divisors instead of strict partitions we have A239312, ranks A368110.
The complement for divisors is A370320, ranks A355740.
For prime factors instead of strict partitions we have A370592, ranks A368100.
The complement for prime factors is A370593, ranks A355529.
The complement for initial intervals is A387118, ranks A387113.
The complement for all partitions is A387134, ranks A387577.
The complement is counted by A387137, ranks A387176.
These partitions are ranked by A387177.
For all partitions instead of just strict partitions we have A387328, ranks A387576.
The complement for constant partitions is A387329, ranks A387180.
For constant partitions instead of strict partitions we have A387330, ranks A387181.
A000041 counts integer partitions, strict A000009.
A358914 counts twice-partitions into distinct strict partitions.
A367902 counts choosable set-systems, complement A367903.
Cf. A005703, A052335, A261049, A270995, A276078, A335448, A367867, A367901, A387115.

strptns[n_]:=Select[IntegerPartitions[n],UnsameQ@@#&];
Table[Length[Select[IntegerPartitions[n],Select[Tuples[strptns/@#],UnsameQ@@#&]!={}&]],{n,0,15}]

A387180 Numbers of which it is not possible to choose a different constant integer partition of each prime index.

Original entry on oeis.org

4, 8, 12, 16, 20, 24, 27, 28, 32, 36, 40, 44, 48, 52, 54, 56, 60, 64, 68, 72, 76, 80, 81, 84, 88, 92, 96, 100, 104, 108, 112, 116, 120, 124, 125, 128, 132, 135, 136, 140, 144, 148, 152, 156, 160, 162, 164, 168, 172, 176, 180, 184, 188, 189, 192, 196, 200, 204

Offset: 1

Gus Wiseman, Aug 30 2025

First differs from A276079 in having 125.
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.
Also numbers n with at least one prime index k such that the multiplicity of prime(k) in the prime factorization of n exceeds the number of divisors of k.

			The prime indices of 60 are {1,1,2,3}, and we have the following 4 choices of constant partitions:
  ((1),(1),(2),(3))
  ((1),(1),(2),(1,1,1))
  ((1),(1),(1,1),(3))
  ((1),(1),(1,1),(1,1,1))
Since none of these is strict, 60 is in the sequence.
The prime indices of 90 are {1,2,2,3}, and we have the following 4 strict choices:
  ((1),(2),(1,1),(3))
  ((1),(2),(1,1),(1,1,1))
  ((1),(1,1),(2),(3))
  ((1),(1,1),(2),(1,1,1))
So 90 is not in the sequence.

For prime factors instead of constant partitions we have A355529, counted by A370593.
For divisors instead of constant partitions we have A355740, counted by A370320.
The complement for prime factors is A368100, counted by A370592.
The complement for divisors is A368110, counted by A239312.
The complement for initial intervals is A387112, counted by A238873.
For initial intervals instead of partitions we have A387113, counted by A387118.
These are the positions of zero in A387120.
For strict instead of constant partitions we have A387176, counted by A387137.
The complement for strict partitions is A387177, counted by A387178.
Twice-partitions of this type are counted by A387179, constant-block case of A296122.
The complement is A387181 (nonzeros of A387120), counted by A387330.
Partitions of this type are counted by A387329.
A000041 counts integer partitions, strict A000009.
A003963 multiplies together prime indices.
A112798 lists prime indices, row sums A056239 or A066328, lengths A001222.
A120383 lists numbers divisible by all of their prime indices.
A289509 lists numbers with relatively prime prime indices.
Cf. A355739, A367771, A387111, A387115.
Cf. A000005, A052335, A063834, A276079, A299200, A299201, A335433, A335448, A355731, A383706, A387110.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],Select[Tuples[Select[IntegerPartitions[#],SameQ@@#&]&/@prix[#]],UnsameQ@@#&]=={}&]

A303940 Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of Product_{j>=1} (1-x^(j*(j+k)))/(1-x^j). in powers of x.

Original entry on oeis.org

1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 2, 3, 2, 1, 1, 2, 3, 4, 4, 3, 1, 1, 2, 3, 4, 5, 5, 3, 1, 1, 2, 3, 5, 6, 8, 7, 5, 1, 1, 2, 3, 5, 6, 9, 10, 10, 5, 1, 1, 2, 3, 5, 7, 10, 12, 14, 13, 8, 1, 1, 2, 3, 5, 7, 10, 13, 17, 18, 17, 9, 1, 1, 2, 3, 5, 7, 11, 14, 19, 23, 25, 22, 13

Offset: 0

Seiichi Manyama, May 03 2018

A(n,k) is the number of partitions of n into at most 0+k copies of 1, 1+k copies of 2, 2+k copies of 3, ... .

			Square array begins:
   1, 1, 1, 1,  1,  1,  1,  1, ...
   0, 1, 1, 1,  1,  1,  1,  1, ...
   1, 1, 2, 2,  2,  2,  2,  2, ...
   1, 2, 2, 3,  3,  3,  3,  3, ...
   1, 3, 4, 4,  5,  5,  5,  5, ...
   2, 4, 5, 6,  6,  7,  7,  7, ...
   3, 5, 8, 9, 10, 10, 11, 11, ...

Seiichi Manyama, Antidiagonals n = 0..139, flattened

Columns k=0..2 give A087153, A052335, A303939.

Main diagonal gives A000041.

A325132 Number of integer partitions of n where the multiplicity of each part k is at least prime(k).

Original entry on oeis.org

1, 0, 1, 1, 1, 1, 2, 1, 3, 2, 4, 3, 5, 4, 6, 6, 7, 7, 10, 8, 11, 12, 12, 14, 17, 16, 20, 22, 24, 26, 31, 31, 37, 39, 43, 46, 54, 53, 63, 65, 73, 75, 87, 87, 100, 102, 115, 117, 133, 134, 151, 155, 172, 176, 197, 202, 223, 231, 254, 262, 290, 298, 327, 341, 370

Offset: 0

Gus Wiseman, Apr 01 2019

nonn

The Heinz numbers of these partitions are given by A054744.

			The first few terms count the following integer partitions:
   0: ()
   2: (11)
   3: (111)
   4: (1111)
   5: (11111)
   6: (222)
   6: (111111)
   7: (1111111)
   8: (2222)
   8: (22211)
   8: (11111111)
   9: (222111)
   9: (111111111)
  10: (22222)
  10: (222211)
  10: (2221111)
  10: (1111111111)
  11: (2222111)
  11: (22211111)
  11: (11111111111)
  12: (222222)
  12: (2222211)
  12: (22221111)
  12: (222111111)
  12: (111111111111)

Cf. A052335, A054744, A062457, A087153, A117144, A324525, A324572.

Table[Length[Select[IntegerPartitions[n],And@@Table[Count[#,i]>=Prime[i],{i,Union[#]}]&]],{n,0,30}]

G.f.: Product_{k>=1} (1 + x^(prime(k)*k) / (1 - x^k)). - Ilya Gutkovskiy, Nov 28 2020

A303944 Number of partitions of n into at most 1^2 copy of 1, 2^2 copies of 2, 3^2 copies of 3, ... .

Original entry on oeis.org

1, 1, 1, 2, 3, 4, 6, 8, 11, 15, 19, 25, 34, 43, 55, 71, 90, 113, 143, 178, 222, 276, 340, 418, 515, 628, 765, 931, 1128, 1362, 1643, 1974, 2369, 2836, 3385, 4033, 4800, 5694, 6745, 7978, 9418, 11096, 13057, 15334, 17985, 21062, 24626, 28753, 33534, 39045, 45408, 52744, 61187

Offset: 0

Seiichi Manyama, May 03 2018

nonn

			  n |                                | a(n)
----+--------------------------------+------
  1 | 1                              |  1
  2 | 2                              |  1
  3 | 3, 2+1                         |  2
  4 | 4, 3+1, 2+2                    |  3
  5 | 5, 4+1, 3+2, 2+2+1             |  4
  6 | 6, 5+1, 4+2, 3+3, 3+2+1, 2+2+2 |  6

Cf. A034262, A052335, A303942.

G.f.: Product_{k>=1} (1-x^(k*(k^2+1)))/(1-x^k).

A319758 Expansion of Product_{k>=1} 1/(1 - Sum_{j=1..k} x^(j*k)).

Original entry on oeis.org

1, 1, 2, 3, 6, 8, 15, 20, 34, 48, 76, 103, 165, 222, 335, 461, 683, 919, 1352, 1813, 2611, 3519, 4985, 6651, 9408, 12501, 17401, 23165, 32009, 42312, 58241, 76748, 104725, 138017, 187155, 245521, 332135, 434536, 584023, 763799, 1022507, 1332549, 1779534, 2314437, 3077540, 3999825

Offset: 0

Ilya Gutkovskiy, Sep 27 2018

nonn

Vaclav Kotesovec, Table of n, a(n) for n = 0..1000

Cf. A052335, A115584.

a:=series(mul(1/(1-add(x^(j*k),j=1..k)),k=1..100),x=0,46): seq(coeff(a,x,n),n=0..45); # Paolo P. Lava, Apr 02 2019

nmax = 45; CoefficientList[Series[Product[1/(1 - Sum[x^(j k), {j, 1, k}]), {k, 1, nmax}], {x, 0, nmax}], x]

G.f.: Product_{k>=1} (1 - x^k)/(1 - 2*x^k + x^(k*(k+1))).
From Vaclav Kotesovec, Sep 27 2018: (Start)
a(n) ~ c * phi^(n/2), where
c = 188.4773924093125890061786423020365148584841831715... if n is even
c = 187.5693962190327254176348797865060646998844995050... if n is odd
phi = A001622 = (1+sqrt(5))/2 is the golden ratio. (End)

A369766 Maximal coefficient of Product_{i=1..n} Sum_{j=0..i} x^(i*j).

Original entry on oeis.org

1, 1, 1, 2, 6, 24, 115, 662, 4456, 34323, 298220, 2885156, 30760556, 358379076, 4530375092, 61762729722, 903311893770, 14108704577103, 234387946711329, 4127027097703638, 76774080851679152, 1504640319524566870, 30986929089570280955, 669023741837953551188

Offset: 0

Ilya Gutkovskiy, Jan 31 2024

nonn

Cf. A000140, A025591, A052335.

a:= n-> max(coeffs(expand(mul(add(x^(i*j), j=0..i), i=1..n)))):
seq(a(n), n=0..23);  # Alois P. Heinz, Jan 31 2024

Table[Max[CoefficientList[Product[Sum[x^(i j), {j, 0, i}], {i, 1, n}], x]], {n, 0, 23}]

a(n) = vecmax(Vec(prod(i=1, n, sum(j=0, i, x^(i*j))))); \\ Michel Marcus, Jan 31 2024

from collections import Counter
def A369766(n):
    c = {0:1,1:1}
    for i in range(2,n+1):
        d = Counter()
        for k in c:
            for j in range(0,i*i+1,i):
                d[j+k] += c[k]
        c = d
    return max(c.values()) # Chai Wah Wu, Jan 31 2024

A387328 Number of integer partitions of n whose parts have choosable sets of integer partitions.

Original entry on oeis.org

1, 1, 1, 2, 3, 4, 5, 7, 10, 13, 17, 22, 28, 36, 46, 58, 73, 91, 114, 141, 174, 214, 262, 320, 389, 472, 571, 688, 828, 993, 1189, 1419, 1690, 2009, 2383, 2821, 3334, 3931, 4628, 5439, 6381, 7474, 8741, 10207, 11902, 13858, 16114, 18710, 21698, 25130, 29070

Offset: 0

Gus Wiseman, Sep 01 2025

First differs from A052335 at A052335(20) = 173, a(20) = 174, corresponding to the partition (4,4,4,4,4).
a(n) is the number of integer partitions of n such that it is possible to choose a sequence of distinct integer partitions, one of each part.
Also the number of integer partitions y of n with no part k whose multiplicity in y exceeds A000041(k).

			The a(1) = 1 through a(9) = 13 partitions:
  (1)  (2)  (3)   (4)   (5)    (6)    (7)    (8)     (9)
            (21)  (22)  (32)   (33)   (43)   (44)    (54)
                  (31)  (41)   (42)   (52)   (53)    (63)
                        (221)  (51)   (61)   (62)    (72)
                               (321)  (322)  (71)    (81)
                                      (331)  (332)   (333)
                                      (421)  (422)   (432)
                                             (431)   (441)
                                             (521)   (522)
                                             (3221)  (531)
                                                     (621)
                                                     (3321)
                                                     (4221)

The strict case is A000009.
For initial intervals instead of partitions we have A238873, complement A387118.
For divisors instead of partitions we have A239312, complement A370320.
For prime factors instead of partitions we have A370592, ranks A368100.
The complement for prime factors is A370593, ranks A355529.
The complement is counted by A387134, ranks A387577.
For sets of strict partitions we have A387178, complement A387137.
These partitions are ranked by A387576.
A000005 counts divisors.
A000041 counts integer partitions.
Cf. A052335, A052337, A335433, A367771, A370585, A370804.

Table[Length[Select[IntegerPartitions[n],Select[Tuples[IntegerPartitions/@#],UnsameQ@@#&]!={}&]],{n,0,15}]

cp's OEIS Frontend

A387177 Numbers whose prime indices have choosable sets of strict integer partitions. Positions of nonzero terms in A387115.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A387178 Number of integer partitions of n whose parts have choosable sets of strict integer partitions.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A387180 Numbers of which it is not possible to choose a different constant integer partition of each prime index.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A303940 Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of Product_{j>=1} (1-x^(j*(j+k)))/(1-x^j). in powers of x.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A325132 Number of integer partitions of n where the multiplicity of each part k is at least prime(k).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A303944 Number of partitions of n into at most 1^2 copy of 1, 2^2 copies of 2, 3^2 copies of 3, ... .

Views

Author

Keywords

Examples

Crossrefs

Formula

A319758 Expansion of Product_{k>=1} 1/(1 - Sum_{j=1..k} x^(j*k)).

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A369766 Maximal coefficient of Product_{i=1..n} Sum_{j=0..i} x^(i*j).

Views

Author

Keywords

Crossrefs

Programs

Maple

Mathematica

PARI

Python

A387328 Number of integer partitions of n whose parts have choosable sets of integer partitions.

Views

Author

Keywords

Comments

Examples

Crossrefs