|
Search: id:A005942
|
|
|
| A005942 |
|
a(2n)=a(n)+a(n+1), a(2n+1)=2a(n+1), if n>1.
(Formerly M1007)
|
|
+0
6
|
|
| 1, 2, 4, 6, 10, 12, 16, 20, 22, 24, 28, 32, 36, 40, 42, 44, 46, 48, 52, 56, 60, 64, 68, 72, 76, 80, 82, 84, 86, 88, 90, 92, 94, 96, 100, 104, 108, 112, 116, 120, 124, 128, 132, 136, 140, 144, 148, 152, 156, 160, 162, 164, 166, 168, 170, 172, 174, 176, 178, 180, 182
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
S. Brlek, Enumeration of factors in the Thue-Morse word, Discrete Applied Math., 24 (1989), 83-96.
De Luca, Aldo; Varricchio, Stefano; Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups. Theoret. Comput. Sci. 63 (1989), no. 3, 333-348.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=0..1000
|
|
FORMULA
|
a(n) = 2*(A006165(n-1) + n - 1), n>1.
G.f. (1+x^2)/(1-x)^2 + 2x^2/(1-x)^2 * sum(k>=0, x^2^(k+1)-x^(3*2^k)). - Ralf Stephan, Jun 04 2003
|
|
PROGRAM
|
(PARI) a(n)=if(n<4, 2*max(0, n)+(n==0), if(n%2, 2*a((n+1)/2), a(n/2)+a(n/2+1)))
|
|
CROSSREFS
|
Cf. A005943, A006697.
Adjacent sequences: A005939 A005940 A005941 this_sequence A005943 A005944 A005945
Sequence in context: A117891 A072752 A036634 this_sequence A024907 A033098 A033868
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
njas, Jeffrey Shallit
|
|
|
Search completed in 0.002 seconds
|
