A116373 Number of partitions of n into parts with digital root = 3.

0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 2, 0, 0, 2, 0, 0, 2, 0, 0, 3, 0, 0, 4, 0, 0, 4, 0, 0, 5, 0, 0, 6, 0, 0, 7, 0, 0, 8, 0, 0, 10, 0, 0, 11, 0, 0, 13, 0, 0, 15, 0, 0, 17, 0, 0, 19, 0, 0, 23, 0, 0, 26, 0, 0, 29, 0, 0, 33, 0, 0, 38, 0, 0, 42, 0, 0, 48, 0, 0, 54, 0, 0, 61, 0, 0, 68, 0, 0, 77, 0, 0, 85, 0, 0, 96

Offset: 1

Author

Reinhard Zumkeller, Feb 12 2006

Keywords

• nonn
• base

Comments

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

Examples

			a(21) = #{21, 12+3+3+3, 3+3+3+3+3+3+3} = 3.
		

Links

• Eric Weisstein's World of Mathematics, Digital Root

Crossrefs

Cf. A010888.

A147706. [From Reinhard Zumkeller, Nov 11 2008]

Formula

a(n) = A035382(floor(n/3))*0^(n mod 3).