A214651 Count down from n to 1, n times.

1, 2, 1, 2, 1, 3, 2, 1, 3, 2, 1, 3, 2, 1, 4, 3, 2, 1, 4, 3, 2, 1, 4, 3, 2, 1, 4, 3, 2, 1, 5, 4, 3, 2, 1, 5, 4, 3, 2, 1, 5, 4, 3, 2, 1, 5, 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, 6, 5, 4, 3, 2, 1, 6, 5, 4, 3, 2, 1, 6, 5

Offset: 1

Author

Arkadiusz Wesolowski, Jul 24 2012

Keywords

• easy
• nonn
• tabf

Comments

This sequence contains every positive integer infinitely often.

This is a fractal sequence. Striking out the first instance of every term produces 1, 2, 1, 2, 1, 3, 2, 1, 3, 2, 1, 3, ..., which is the same as the original sequence, as far as it goes.

Examples

			1;
2, 1, 2, 1;
3, 2, 1, 3, 2, 1, 3, 2, 1;
...
		

Links

• Arkadiusz Wesolowski, Rows n = 1..14 of triangle, flattened
• Eric Weisstein's World of Mathematics, Positive Integer
• Wikipedia, Fractal sequence

Crossrefs

Cf. A056520 (locations of new values), A060432 (locations of 1's).

Cf. A000290 (row lengths), A002411 (row sums), A036740 (row products).

Programs

Mathematica

f[n_] := Table[Range[n, 1, -1], {n}]; Flatten@Array[f, 6] (* Wesolowski *)
Flatten[Table[Table[Range[n, 1, -1], {n}], {n, 6}]] (* Alonso del Arte, Jul 24 2012 *)