Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A089215
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A089215 Thue-Morse sequence on the integers. +0
1
1, 2, 3, 2, 4, 3, 2, 3, 5, 4, 3, 4, 2, 3, 4, 3, 6, 5, 4, 5, 3, 4, 5, 4, 2, 3, 4, 3, 5, 4, 3, 4, 7, 6, 5, 6, 4, 5, 6, 5, 3, 4, 5, 4, 6, 5, 4, 5, 2, 3, 4, 3, 5, 4, 3, 4, 6, 5, 4, 5, 3, 4, 5, 4, 8, 7, 6, 7, 5, 6, 7, 6, 4, 5, 6, 5, 7, 6, 5, 6, 3, 4, 5, 4, 6, 5, 4, 5, 7, 6, 5, 6, 4, 5, 6, 5, 2, 3, 4, 3, 5, 4, 3, 4, 6 (list; graph; listen)
OFFSET

1,2

COMMENT

S(1)={1,2} then M(1)=4 and S'(1)={4-1,4-2}={3,2}. So S(2)={1,2,3,2}. M(2)=5 so S(3)={1,2,3,2}{5-1,5-2,5-3,5-2} and sequence begins 1,2,3,2,4,3,2,3,..

FORMULA

sum(k=1, n, a(k)) is asymptotic to C*n*log(n) with C=0.8....

EXAMPLE

Sequence is S(infinity) where S(1)={1,2} and S(n+1)=S(n)S'(n) where S'(n) is obtained from S(n) by substituting an element x of S(n) with M(n)-x where M(n)=2+Max(S(n)}. Thue-Morse sequence on alphabet {1,2}is constructed as follows: S(1)={1,2} and S(n+1)=S(n)S'(n) where S'(n) is obtained from S(n) by substituting an element x of S(n) with 3-x

CROSSREFS

Cf. A001285.

Sequence in context: A155520 A105117 A100876 this_sequence A070296 A072645 A135817

Adjacent sequences: A089212 A089213 A089214 this_sequence A089216 A089217 A089218

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Dec 10 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research