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.

A296371 Number of integer partitions of n using Jacobsthal numbers.

Original entry on oeis.org

1, 1, 1, 2, 2, 3, 4, 4, 5, 6, 7, 9, 10, 11, 13, 15, 17, 19, 21, 23, 26, 30, 33, 36, 40, 44, 49, 54, 58, 63, 69, 75, 82, 89, 95, 103, 112, 120, 129, 138, 147, 158, 170, 182, 194, 207, 221, 236, 252, 267, 283, 301, 319, 339, 360, 380, 402, 426, 450, 475, 501, 527
Offset: 0

Views

Author

Gus Wiseman, Dec 11 2017

Keywords

Examples

			The a(10) = 7 partitions are (1111111111), (31111111), (331111), (3331), (511111), (5311), (55).
		

Crossrefs

Programs

  • Mathematica
    nn=6;
    jac[n_]:=(2^n-(-1)^n)/3;
    Table[SeriesCoefficient[Product[1/(1-x^jac[i]),{i,2,nn}],{x,0,n}],{n,jac[nn]}]