A128117 At the n-th iteration the sequence of integers from 1 to n are appended to the sequence a(n) times.

1, 1, 2, 1, 2, 3, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 6, 1, 2, 3, 4, 5, 6, 1, 2, 3, 4, 5, 6, 1, 2, 3, 4, 5, 6, 7, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 1, 2, 3, 4

Offset: 1

Author

Reed Kelly, Feb 15 2007

Keywords

• easy
• nonn

Examples

			a(5) = 2 so 1,2,3,4,5,1,2,3,4,5 is added to the end of the sequence at the fifth iteration.
		

Links

• Rémy Sigrist, Table of n, a(n) for n = 1..10258 (first 371 terms from Reed Kelly)

Crossrefs

Cf. A001462.

Programs

Mathematica

cr[n_] := Module[ { A = {1,1,2}, i, j }, For [ i = 3, i <= n, i++, A = Join[ A, Flatten[ Table[ Range[i], {A[[i]]} ]]]; ]; A ]

PARI

a = vector(101, n, 1); m=0; for (n=1, 10, for (t=1, a[n], for (k=1, n, print1 (a[m++]=k", ")))) \\ Rémy Sigrist, Feb 09 2022