login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A147706 Number of partitions of n into parts having distinct digital roots (A010888). 10
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 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

a(n) <= A000009(n).

Likely a duplicate of A114098. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Dec 13 2008]

EXAMPLE

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

A114102, A116371, A116372, A116373, A116374, A116375, A116376, A116377, A116378, A114099.

Sequence in context: A008674 A067596 A114098 * A034141 A055002 A114097

Adjacent sequences:  A147703 A147704 A147705 * A147707 A147708 A147709

KEYWORD

base,nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 11 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 21:56 EST 2012. Contains 205860 sequences.