|
| |
|
|
A073267
|
|
Number of ordered partitions of n into exactly two powers of 2.
|
|
6
| |
|
|
0, 0, 1, 2, 1, 2, 2, 0, 1, 2, 2, 0, 2, 0, 0, 0, 1, 2, 2, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 1, 2, 2, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 2, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,4
|
|
|
COMMENTS
| Starting with 1 = self-convolution of A036987, the characteristic function of the powers of 2. [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Feb 23 2010]
|
|
|
LINKS
| Sen-Peng Eu, Shu-Chung Liu and Yeong-Nan Yeh, Catalan and Motzkin numbers modulo 4 and 8, Eur. J. Combinat. 29 (2008) 1449-1466.
|
|
|
FORMULA
| G.f.: (Sum_{k>=0} x^(2^k))^2. - Vladeta Jovovic (vladeta(AT)eunet.rs), Mar 28 2005
a(n+1) = A000108(n) mod 4, n>=1 [Theorem 2.3 of Eu et al.]. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 27 2008
|
|
|
EXAMPLE
| For 2 there is only partition {1+1}, for 3 there is {1+2, 2+1}, for 4 {2+2}, for 5 {1+4, 4+1}, for 6 {2+4,4+2}, for 7 none, thus a(2)=1, a(3)=2, a(4)=1, a(5)=2, a(6)=2 and a(7)=0.
|
|
|
CROSSREFS
| The second row of the table A073265. The essentially same sequence 1, 1, 2, 1, 2, 2, 0, 1, ... occurs for first time in A073202 as row 105 (the fix count sequence of A073290). The positions of 1's for n > 1 is given by the characteristic function of A000079, i.e. A036987 with offset 1 instead of 0 and the positions of 2's is given by A018900. Cf. also A023359.
Cf. A036987 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Feb 23 2010]
Sequence in context: A025075 A175609 A038717 * A159981 A071858 A122864
Adjacent sequences: A073264 A073265 A073266 * A073268 A073269 A073270
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Antti Karttunen Jun 25 2002
|
| |
|
|
