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

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

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
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, 49, 55, 65, 73, 82, 86, 97, 109, 122, 129, 145, 163, 171, 193, 217, 244, 257, 289, 325, 342, 365, 385, 433, 487, 513, 577, 649, 683, 730, 769, 865, 973, 1025, 1094, 1153 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,5

COMMENTS

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

LINKS

Table of n, a(n) for n=0..62.

FORMULA

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

EXAMPLE

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.

CROSSREFS

Cf. A022328, A022329.

Cf. A117222, A117220, A117221.

Sequence in context: A067842 A164066 A053251 * A174575 A029057 A087897

Adjacent sequences:  A090181 A090182 A090183 * A090185 A090186 A090187

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Jan 21 2004

STATUS

approved

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

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

Last modified July 29 05:03 EDT 2014. Contains 245018 sequences.