A113138 Self-describing sequence made of strings of consecutive integers. The number of elements in each string is the sequence itself.

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

Offset: 1

Author

Eric Angelini, Jan 04 2006

Keywords

• easy
• nonn
• nice

Comments

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

Examples

			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.
		

Links

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

Crossrefs

Cf. A281579.

Extensions

More terms from Rémy Sigrist, Feb 08 2017