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.

A166247 Number of perfect partitions of n-1 plus sum of remainders of n mod k, for k=1,2,3,..,n.

Original entry on oeis.org

1, 1, 2, 3, 5, 6, 9, 12, 14, 16, 23, 25, 29, 34, 39, 44, 52, 55, 65, 69, 73, 80, 99, 105, 105, 115, 129, 132, 152, 151, 168, 183, 187, 200, 221, 224, 234, 251, 272, 278, 298, 297, 326, 336, 347, 361, 404, 422, 416, 428, 452, 462, 506, 512, 532, 540, 556, 581, 636
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Oct 10 2009

Keywords

Crossrefs

Formula

a(n)=A002033(n-1)+A004125(n).

Extensions

Indices in definition and formula corrected by R. J. Mathar, May 21 2010