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.

Showing 1-2 of 2 results.

A347867 Number of partitions of n such that 3*(greatest part) >= (number of parts).

Original entry on oeis.org

1, 2, 3, 4, 6, 10, 14, 20, 27, 38, 51, 70, 92, 123, 162, 212, 274, 355, 453, 579, 733, 928, 1165, 1463, 1822, 2269, 2808, 3470, 4266, 5241, 6407, 7823, 9514, 11554, 13983, 16900, 20359, 24494, 29386, 35205, 42069, 50206, 59773, 71069, 84322, 99913, 118157, 139556, 164528, 193734
Offset: 1

Views

Author

Seiichi Manyama, Jan 25 2022

Keywords

Comments

Also, the number of partitions of n such that (greatest part) <= 3*(number of parts).

Crossrefs

Programs

  • PARI
    my(N=66, x='x+O('x^N)); Vec(sum(k=1, N, x^k*prod(j=1, k, (1-x^(3*k+j-1))/(1-x^j))))

Formula

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

A347868 Number of partitions of n such that 4*(greatest part) >= (number of parts).

Original entry on oeis.org

1, 2, 3, 5, 6, 10, 14, 21, 29, 40, 53, 73, 96, 129, 168, 221, 284, 369, 471, 603, 763, 966, 1211, 1521, 1892, 2355, 2912, 3600, 4423, 5434, 6639, 8107, 9855, 11968, 14476, 17495, 21067, 25342, 30393, 36406, 43489, 51891, 61761, 73421, 87087, 103172, 121977, 144045, 169780, 199883
Offset: 1

Views

Author

Seiichi Manyama, Jan 25 2022

Keywords

Comments

Also, the number of partitions of n such that (greatest part) <= 4*(number of parts).

Crossrefs

Programs

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

Formula

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