|
Search: id:A062051
|
|
|
| A062051 |
|
Number of partitions of n into parts which are powers of 3. |
|
+0
13
|
|
| 1, 1, 1, 2, 2, 2, 3, 3, 3, 5, 5, 5, 7, 7, 7, 9, 9, 9, 12, 12, 12, 15, 15, 15, 18, 18, 18, 23, 23, 23, 28, 28, 28, 33, 33, 33, 40, 40, 40, 47, 47, 47, 54, 54, 54, 63, 63, 63, 72, 72, 72, 81, 81, 81, 93, 93, 93, 105, 105, 105, 117, 117, 117, 132, 132, 132, 147, 147, 147, 162
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
Number of different partial sums of 1+[1,*3]+[1,*3]+..., where [1,*3] means we can either add 1 or multiply by 3. E.g. a(6)=3 because we have 6=1+1+1+1+1+1=(1+1)*3=1*3+1+1+1 - Jon Perry (perry(AT)globalnet.co.uk), Jan 01 2004
Also number of partitions of n into distinct 3-smooth parts. E.g. a(10) = #{9+1, 8+2, 6+4, 6+3+1, 4+3+2+1} = #{9+1, 3+3+3+1, 3+3+1+1+1+1, 3+1+1+1+1+1+1+1, 1+1+1+1+1+1+1+1+1+1} = 5. - Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Apr 07 2005
|
|
LINKS
|
M. Latapy, Partitions of an integer into powers, DMTCS Proceedings AA (DM-CCG), 2001, 215-228.
|
|
FORMULA
|
a(n)=A005704([n/3]).
|
|
EXAMPLE
|
a(4) = 2, and the partitions are 3+1, 1+1+1+1; a(9) = 5, and the partitions are 9; 3+3+3; 3+3+1+1+1; 3+1+1+1+1+1+1; 1+1+1+1+1+1+1+1+1.
|
|
PROGRAM
|
(PARI) { n=15; v=vector(n); for (i=1, n, v[i]=vector(2^(i-1))); v[1][1]=1; for (i=2, n, k=length(v[i-1]); for (j=1, k, v[i][j]=v[i-1][j]+1; v[i][j+k]=v[i-1][j]*3)); c=vector(n); for (i=1, n, for (j=1, 2^(i-1), if (v[i][j]<=n, c[v[i][j]]++))); c } (Jon Perry)
|
|
CROSSREFS
|
A005704 with terms repeated 3 times. Cf. A000123, A018819.
Cf. A000009, A003586, A105420, A039966.
Cf. A018819, A023893, A105420, A106244, A131995.
Sequence in context: A076973 A008649 A008650 this_sequence A108711 A029059 A035449
Adjacent sequences: A062048 A062049 A062050 this_sequence A062052 A062053 A062054
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 06 2001
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), Jun 11 2001
|
|
|
Search completed in 0.002 seconds
|
