A139420 a(n) = length of n-th run of consecutive numbers in A136120.

1, 3, 2, 2, 5, 2, 6, 2, 7, 2, 2, 2, 2, 11, 2, 12, 2, 2, 2, 2, 2, 17, 2, 18, 2, 2, 2, 2, 2, 2, 24, 2, 25, 2, 26, 2, 27, 2, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 38, 2, 39, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 50, 2, 51, 2, 52, 2, 53, 2, 54, 2, 55, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 71, 2, 72, 2, 2, 2

Offset: 1

Author

Klaus Brockhaus, Apr 22 2008

Keywords

• nonn

Examples

			A136120 starts 1, 3, 4, 5, 9, 10, 15, ..., so a(1) = 1, a(2) = 3, a(3) = 2.
		

Links

• Klaus Brockhaus, Table of n, a(n) for n=1..395

Crossrefs

Cf. A136120, A139418, A139419.

Programs

Mathematica

f[seq_] := Module[{s = seq, n1, n2}, n++; n1 = s[[n]] + n; If[n1 <= len, n2 = Min[n - 1 + 2*s[[n]], len]; len -= n2 - n1 + 1; Drop[s, {n1, n2}], s]]; n = 0; len = 29800; Length /@Split[FixedPoint[f, Range[len]], #2 - #1 == 1 &]  (* Jayanta Basu, Jun 15 2013 - using the Mma program in A136120 *)