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

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

Offset: 1

Author

Reed Kelly, Feb 15 2007

Keywords

• easy
• nonn

Examples

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

Links

• Reed Kelly, Feb 15 2007, Table of n, a(n) for n = 1..555

Crossrefs

Cf. A128117, A001462, A002260.

Programs

Mathematica

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