Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026497
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026497 a(n) = length of n-th run of identical symbols in A026492. +0
1
7, 1, 6, 1, 8, 1, 3, 3, 1, 1, 7, 1, 6, 1, 7, 1, 1, 3, 3, 1, 8, 1, 6, 1, 8, 1, 3, 3, 1, 1, 7, 1, 3, 3, 1, 7, 1, 1, 3, 3, 1, 1, 7, 1, 6, 1, 8, 1, 3, 3, 1, 1, 7, 1, 3, 3, 2, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 3, 2, 3, 2, 3, 2, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 3 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Sequence in context: A089204 A107786 A154932 this_sequence A010146 A092615 A086309

Adjacent sequences: A026494 A026495 A026496 this_sequence A026498 A026499 A026500

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research