login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A113138 Self-describing sequence made of strings of consecutive integers. The number of elements in each string is the sequence itself. 0
1, 3, 4, 5, 1, 2, 3, 4, 1, 2, 3, 4, 5, 1, 3, 4, 1, 2, 3, 1, 2, 3, 4, 1, 3, 4, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 5, 1, 3, 4, 5, 1, 2, 3, 4, 1, 3, 4, 1, 2, 3 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

The less interesting sequence 1,1,1,1,1,1,1,1, ... obeys the same rule.

EXAMPLE

First string is "1", having 1 element. Second string is "3,4,5" having 3 elements. Third string is "1,2,3,4" which has 4 elements. Next string is "1,2,3,4,5", made of 5 elements. Next string is "1", having only 1 element, etc. So we have 1 element, then 3, then 4, then 5, then 1, etc. This is the sequence itself.

CROSSREFS

Sequence in context: A158962 A199066 A176948 * A010263 A011303 A051993

Adjacent sequences:  A113135 A113136 A113137 * A113139 A113140 A113141

KEYWORD

easy,nonn

AUTHOR

Eric Angelini (eric.angelini(AT)kntv.be), Jan 04 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 11:25 EST 2012. Contains 205907 sequences.