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.

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

Original entry on oeis.org

1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13, 14, 15, 17, 18, 20, 22, 24, 26, 29, 31, 34, 37, 40, 43, 47, 50, 54, 58, 62, 66, 71, 75, 80, 85, 90, 95, 101, 106, 113, 119, 126, 133, 142, 149, 159, 168, 179, 189, 202
Offset: 0

Views

Author

Seiichi Manyama, May 22 2024

Keywords

Comments

This sequence is different from A350894.

Crossrefs

Programs

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

Formula

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