Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125058
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125058 A sequence of words over an alphabet of two letters: a(0) = 1, a(1) = 2; a(n+2) = a(n+1)a(n)a(n+1). +0
2
1, 2, 212, 2122212, 21222122122122212, 21222122122122212212221221222122122122212, 21222122122122212212221221222122122122212212221221221222122122212212212221221222\ 1221222122122122212 (list; graph; listen)
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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research