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.

A218380 Number of partitions of n into distinct pentagonal parts.

Original entry on oeis.org

1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 2, 1, 0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 2, 1, 0, 0, 1, 2, 1, 0, 0, 0, 1, 2, 1, 0, 0, 0, 1, 2, 2, 1, 0, 1, 2, 2, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 2, 2
Offset: 0

Views

Author

Antonio Roldán, Oct 27 2012

Keywords

Examples

			A(98)=3 because 98 = 12 + 35 + 51 = 1 + 5 + 92 = 1 + 5 + 22 + 70 with 1, 5, 22, 70, 92 pentagonal numbers.
		

Crossrefs

Programs

  • PARI
    { for (n=1, 100, m=polcoeff(prod(k=1, truncate(1+sqrt(24*n+1))/6, 1+x^(k*(3*k-1)/2)), n);write("B218380.txt",n, " ",m)) }

Extensions

a(0) = 1 prepended by Seiichi Manyama, Dec 09 2017