Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083933
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083933 A063171-encoding of A083923-trees. +0
2
0, 1100, 11001100, 11110000, 110011001100, 110011110000, 111100001100, 111100110000, 111111000000, 1100110011001100, 1100110011110000, 1100111100001100, 1100111100110000, 1100111111000000, 1111000011001100 (list; graph; listen)
OFFSET

0,2

COMMENT

Subset of totally balanced binary strings (A063171) with only even runs of either bit 0 or 1 occurring.

FORMULA

a(n) = A007088(A083932(n))

CROSSREFS

Permutation of A080317 from which this differs first time at the sixth term, with a(6)=111100001100, while A080317(6)=111111000000.

Sequence in context: A078199 A147816 A050926 this_sequence A080317 A068279 A060519

Adjacent sequences: A083930 A083931 A083932 this_sequence A083934 A083935 A083936

KEYWORD

nonn

AUTHOR

Antti Karttunen (MyFirstname.MySurname(AT)iki.fi) May 13 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 5 08:23 EST 2009. Contains 170348 sequences.


AT&T Labs Research