A244228 The lengths of runs in A244225, the first differences of A244223.

2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 4, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 4, 2, 3, 2, 3, 2, 2, 2, 3

Offset: 1

Author

Antti Karttunen, Jun 23 2014

Keywords

• nonn

Comments

The sequence gives the distances between successive 1-terms in A244221, i.e. the odd representations in Greedy Catalan Base (A014418, A244161).

a(56) = 4 is the first term larger than 3 in this sequence. Cf. the example section of A244226.

Examples

			The first odd term in A014418 is A014418(1) = 1, and the second occurs at A014418(3) = 11, and the third at A014418(6) = 101, and the fourth at A014418(8) = 111, thus the first three terms of this sequence are (3-1) = 2, (6-3) = 3, (8-6) = 2.
		

Links

• Antti Karttunen, Table of n, a(n) for n = 1..7117

Crossrefs

One more than A244227.

First differences of A244223.

Cf. A244225.

Programs

Scheme

(define (A244228 n) (+ 1 (A244227 n)))

Formula

a(n) = 1 + A244227(n).