A116372 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A116372

Number of partitions of n into parts with digital root = 2.

10

0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3, 1, 3, 1, 3, 1, 3, 2, 3, 3, 3, 4, 3, 4, 3, 4, 4, 4, 6, 4, 7, 4, 8, 4, 8, 5, 8, 7, 8, 9, 8, 10, 8, 11, 9, 11, 12, 11, 15, 11, 17, 11, 18, 12, 19, 15, 19, 19, 19, 22, 19, 24, 20, 25, 24, 26, 29, 26, 34, 26, 37, 27, 39, 31, 40, 38, 41

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,20

COMMENTS

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

LINKS

Table of n, a(n) for n=1..88.

Eric Weisstein's World of Mathematics, Digital Root

EXAMPLE

a(31) = #{29+2, 20+11, 11+2+2+2+2+2} = 3.

CROSSREFS

A147706. [From Reinhard Zumkeller, Nov 11 2008]

Sequence in context: A181801 A029244 A067513 * A232465 A029242 A029236

Adjacent sequences: A116369 A116370 A116371 * A116373 A116374 A116375

KEYWORD

nonn,base

AUTHOR

Reinhard Zumkeller, Feb 12 2006

STATUS

approved