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.

A147706 Number of partitions of n into parts having distinct digital roots (A010888).

Original entry on oeis.org

1, 1, 2, 2, 3, 4, 5, 6, 8, 10, 11, 15, 16, 20, 25, 28, 32, 39, 46, 50, 62, 66, 78, 93, 101, 112, 132, 150, 161, 192, 202, 232, 268, 287, 312, 361, 400, 425, 497, 516, 582, 658, 698, 748, 858, 932, 982, 1135, 1164, 1296, 1443, 1519, 1610, 1845, 1968, 2059, 2360, 2395
Offset: 1

Views

Author

Reinhard Zumkeller, Nov 11 2008

Keywords

Comments

a(n) <= A000009(n).
Likely a duplicate of A114098. [From R. J. Mathar, Dec 13 2008]

Examples

			A000009(16) = 32, in which the following 4 partitions
contain parts with common digital roots:
12 + 3 + 1, 11 + 3 + 2, 10 + 5 + 1 and 10 + 3 + 2 + 1,
therefore a(16) = 32 - 4 = 28.
		

Crossrefs