A373073 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A373073

Number of partitions of n such that (smallest part) > 2*(number of parts).

4

1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 8, 9, 10, 12, 13, 15, 17, 19, 21, 24, 26, 29, 32, 35, 38, 43, 46, 51, 56, 62, 67, 75, 81, 90, 98, 108, 117, 130, 140, 154, 167, 183, 197, 216, 233, 254, 274, 298, 321, 350, 376, 408, 440, 477, 513, 556, 598, 647

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,11

LINKS

Table of n, a(n) for n=0..68.

FORMULA

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

PROG

(PARI) my(N=70, x='x+O('x^N)); Vec(sum(k=0, N, x^(2*k^2+k)/prod(j=1, k, 1-x^j)))

CROSSREFS

Cf. A003106, A373074, A373075, A373076.

Cf. A350893, A373067.

Sequence in context: A286744 A111684 A025159 * A264594 A026829 A025154

Adjacent sequences: A373070 A373071 A373072 * A373074 A373075 A373076

KEYWORD

nonn

AUTHOR

Seiichi Manyama, May 22 2024

STATUS

approved