Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080269
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080269 Breadth-first-wise A063171-like-encoding of the stunted binomial-mod-2 zigzag trees (A080264). +0
4
10, 111000, 1111001000, 111100111110000000, 1111001111110000001000, 111100111111000000111110000000, 11110011111100000011111100110010000000, 111100111111000000111111001100111111111000000000000000 (list; graph; listen)
OFFSET

0,1

COMMENT

These binary words converge to a certain infinite binary sequence: 1,1,1,1,0,0,1,1,1,1,1,1,0,0,0,... [To be computed.]

FORMULA

a(n) = A007088(A080268(n))

CROSSREFS

Cf. A080319.

Sequence in context: A080294 A080974 A080314 this_sequence A080319 A069878 A013854

Adjacent sequences: A080266 A080267 A080268 this_sequence A080270 A080271 A080272

KEYWORD

nonn

AUTHOR

Antti Karttunen (my_firstname.my_surname(AT)iki.fi) Mar 02 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 September 5 23:56 EDT 2008. Contains 143485 sequences.


AT&T Labs Research