This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A090184 Number of partitions of the n-th 3-smooth number into sums of 2s and 3s. 4

%I

%S 0,1,1,1,2,2,2,3,3,4,5,5,6,7,9,10,11,13,14,17,19,22,25,28,33,37,41,43,

%T 49,55,65,73,82,86,97,109,122,129,145,163,171,193,217,244,257,289,325,

%U 342,365,385,433,487,513,577,649,683,730,769,865,973,1025,1094,1153

%N Number of partitions of the n-th 3-smooth number into sums of 2s and 3s.

%C a(n) = A008615(A003586(n) + 2).

%F a(2^i * 3^j) = floor(2^(i-1) * 3^(j-1) + 1), i*j>0.

%e n=10: A003586(10) = 2^3 * 3 = 24: 3+3+3+3+3+3+3+3 = 3+3+3+3+3+3+2+2+2 = 3+3+3+3+2+2+2+2+2+2 = 3+3+2+2+2+2+2+2+2+2+2 = 2+2+2+2+2+2+2+2+2+2+2+2: a(10)=5.

%Y Cf. A022328, A022329.

%Y Cf. A117222, A117220, A117221.

%K nonn

%O 0,5

%A _Reinhard Zumkeller_, Jan 21 2004

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 .