Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A107682
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A107682 The size of every run of identical digits is given by the digit immediately following immediately the said run. There can be no two identical runs in the sequence. +0
1
0, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 9, 2, 2, 2, 3, 3, 2, 2, 2, 2, 4, 4, 2, 2, 2, 2, 2, 5, 5, 2, 2, 2, 2, 2, 2, 6, 6, 2, 2, 2, 2, 2, 2, 2, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 8, 8, 2, 2, 2, 2, 2, 2 (list; graph; listen)
OFFSET

0,4

COMMENT

The sequence is finite.

LINKS

E. Angelini, Auto-chunks.

EXAMPLE

First run ("0") is made of 1 "identical digit(s)", thus is followed by 1; second run ("11") is made of 2 identical digits, thus followed by 2; third run ("2") is made of 1 "identical digit(s)", thus followed by 1; etc.

CROSSREFS

Sequence in context: A098495 A095025 A069897 this_sequence A085476 A124944 A094392

Adjacent sequences: A107679 A107680 A107681 this_sequence A107683 A107684 A107685

KEYWORD

base,easy,fini,nonn

AUTHOR

Eric Angelini (eric.angelini(AT)kntv.be), Jun 10 2005

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 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research