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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A116373 Number of partitions of n into parts with digital root = 3. 11

%I #4 Mar 30 2012 18:50:54

%S 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,

%T 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,

%U 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

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

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

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/DigitalRoot.html">Digital Root</a>

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

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

%Y Cf. A010888.

%Y A147706. [From _Reinhard Zumkeller_, Nov 11 2008]

%K nonn,base

%O 1,12

%A _Reinhard Zumkeller_, Feb 12 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)