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.

A161266 Number of partitions of n into central polygonal numbers A000124 where every part appears at least 13 times.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 10, 9, 10, 10, 12, 11, 12, 12, 14, 13, 14, 14, 16, 16, 17, 17, 19, 19, 20, 20, 22, 22, 23, 23, 25, 25, 27, 26, 29, 28, 31, 29, 33, 31, 35, 32, 37, 34, 39, 37, 42, 39, 45, 42, 49
Offset: 1

Views

Author

R. H. Hardin Jun 06 2009

Keywords