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.

A116378 Number of partitions of n into parts with digital root = 8.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 2, 1, 0, 0, 0, 0, 1, 1, 2, 2, 1, 0, 0, 0, 1, 1, 2, 3, 3, 1, 0, 0, 1, 1, 2, 3, 4, 3, 1, 0, 1, 1, 2, 3, 5, 5, 4, 1, 1, 1, 2, 3, 5, 6, 7, 4, 2, 1, 2, 3, 5, 7, 9, 8, 6, 2, 2, 3, 5, 7, 10, 11, 11, 6, 3, 3, 5, 7, 11, 13
Offset: 1

Views

Author

Reinhard Zumkeller, Feb 12 2006

Keywords

Comments

a(n) = A114102(n) - A116371(n) - A116372(n) - A116373(n) - A116374(n) - A116375(n) - A116376(n) - A116377(n) - A114099(n).

Examples

			a(51) = #{35+8+8, 26+17+8, 17+17+17} = 3.
		

Crossrefs

Cf. A010888.
A147706. [From Reinhard Zumkeller, Nov 11 2008]