|
Search: id:A005599
|
|
|
| A005599 |
|
Running sum of every third term in the {+1,-1}-version of Thue-Morse sequence A010060.
(Formerly M0468)
|
|
+0
1
|
|
| 1, 2, 3, 4, 5, 6, 7, 6, 7, 8, 9, 10, 11, 12, 11, 12, 13, 14, 15, 16, 17, 18, 19, 18, 19, 20, 21, 20, 19, 18, 19, 18, 19, 20, 21, 22, 23, 24, 25, 24, 25, 26, 27, 28, 29, 30, 29, 30, 31, 32, 33, 34, 35, 36, 35
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
The generating function -(2*z**4+z**3+z+1)*(z**3-z**2-1)/(z**6+z**5+z**4+z**3+z**2+z+1)/(z-1)**2 proposed in the Plouffe thesis is wrong.
|
|
REFERENCES
|
J. Coquet, A summation formula related to the binary digits, Inventiones math., 73 (1983), 107-115.
D. J. Newman, On the number of binary digits in a multiple of three, Proc. Amer. Math. Soc., 21 (1969), 719-721.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
P. Flajolet et al., Mellin Transforms And Asymptotics: Digital Sums, Theoret. Computer Sci. 23 (1994), 291-314.
P. J. Grabner, H.-K. Hwang, Digital sums and divide-and-conquer recurrences: Fourier expansions and absolute convergence
S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
|
|
CROSSREFS
|
Sequence in context: A017872 A161209 A000026 this_sequence A071934 A161658 A066853
Adjacent sequences: A005596 A005597 A005598 this_sequence A005600 A005601 A005602
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
M. R. Schroeder.
|
|
|
Search completed in 0.002 seconds
|
