Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080846
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080846 Fixed point of the morphism 0->010, 1->011, starting from a(1) = 0. +0
4
0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1 (list; graph; listen)
OFFSET

0,1

COMMENT

A cube-free word.

REFERENCES

J. Berstel and J. Karhumaki, Combinatorics on words - a tutorial, Bull. EATCS, #79 (2003), pp. 178-228.

LINKS

Jean Berstel, Home Page

FORMULA

a(n) = (A062756(n) - A062756(n+1) + 1)/2, where A062756(n) is the number of 1's in the ternary expansion of n. From formula in A062756: G.f.: A(x) = 1/(1-x)/2 - Sum_{k>=0} x^(3^k-1)/(1+x^(3^k)+x^(2*3^k))/2. - Paul D. Hanna (pauldhanna(AT)juno.com), Feb 24 2006

MATHEMATICA

Nest[Flatten[ # /. {0 -> {0, 1, 0}, 1 -> {0, 1, 1}}] &, {0}, 5]

PROGRAM

(PARI) {a(n)=if(n<1, 0, polcoeff(1/(1-x)/2-sum(k=0, ceil(log(n+1)/log(3)), x^(3^k-1)/(1+x^(3^k)+x^(2*3^k)+x*O(x^n)))/2, n))} - Paul D. Hanna (pauldhanna(AT)juno.com), Feb 24 2006

CROSSREFS

See A060236 for another version.

Cf. A062756.

Adjacent sequences: A080843 A080844 A080845 this_sequence A080847 A080848 A080849

Sequence in context: A078580 A059651 A084091 this_sequence A082401 A157238 A059448

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Mar 29 2003

EXTENSIONS

More terms from Wouter Meeussen (wouter.meeussen(AT)pandora.be), Apr 01 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 July 4 09:27 EDT 2009. Contains 160562 sequences.


AT&T Labs Research