0,4

Antti Karttunen, Table of n, a(n) for n = 0..8192

a(0) = 0; for n >= 1, a(n) = 1 + a(A236840(n)) = 1 + a(n - A005811(n)).

Other identities. For all n >= 0:

a(A255053(n)) = a(A255055(n)) = n.

a(A255056(n)) = n. [This sequence works also as an inverse function for number-of-runs beanstalk A255056.]

(Scheme, with memoization-macro definec)

(definec (A255072 n) (if (zero? n) 0 (+ 1 (A255072 (A236840 n)))))

Cf. A255053 (least inverse), A255055 (greatest inverse), A255054 (run lengths).

Cf. A005811, A236840, A255071, A255056.

Cf. A255061 & A255062 (values at points (2^n)-2 and (2^n)-1).

Analogous sequences: A071542, A219642, A219652

Sequence in context: A173022 A060973 A097915 * A029131 A162351 A087816

Adjacent sequences: A255069 A255070 A255071 * A255073 A255074 A255075

nonn

Antti Karttunen, Feb 14 2015

approved