

A113138


Selfdescribing sequence made of strings of consecutive integers. The number of elements in each string is the sequence itself.


2



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, 1, 3, 4, 1, 2, 3, 1, 2, 3, 4, 1, 3, 4, 5, 1, 2, 3, 4, 1, 3, 4, 1, 2, 3, 1, 3, 4, 1, 2, 3, 1, 2, 3, 4, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

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


LINKS

Rémy Sigrist, Table of n, a(n) for n = 1..1000
Rémy Sigrist, PARI program for A113138


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

Cf. A281579.
Sequence in context: A199066 A306584 A176948 * A010263 A011303 A225405
Adjacent sequences: A113135 A113136 A113137 * A113139 A113140 A113141


KEYWORD

easy,nonn,nice


AUTHOR

Eric Angelini, Jan 04 2006


EXTENSIONS

More terms from Rémy Sigrist, Feb 08 2017


STATUS

approved



