A244315 a(0) = 0, after which, if A176137(n) = 1, a(n) = A007814(A244230(n)), otherwise a(n) = a(n-A197433(A244230(n)-1)).

0, 0, 1, 0, 0, 2, 0, 1, 0, 0, 1, 0, 0, 2, 3, 0, 1, 0, 0, 2, 0, 1, 0, 0, 1, 0, 0, 2, 0, 1, 0, 0, 1, 0, 0, 2, 3, 0, 1, 0, 0, 2, 4, 0, 1, 0, 0, 2, 0, 1, 0, 0, 1, 0, 0, 2, 3, 0, 1, 0, 0, 2, 0, 1, 0, 0, 1, 0, 0, 2, 0, 1, 0, 0, 1, 0, 0, 2, 3, 0, 1, 0, 0, 2, 0, 1, 0, 0, 1, 0, 0, 2, 0, 1, 0, 0, 1, 0, 0, 2, 3, 0, 1, 0, 0, 2, 4, 0, 1, 0, 0, 2, 0, 1, 0, 0, 1, 0, 0, 2, 3, 0, 1, 0, 0, 2, 0, 1, 0, 0, 1, 0, 5

Offset: 0

Author

Antti Karttunen, Jun 25 2014

Keywords

• nonn

Comments

For n >= 1, a(n) tells the zero-based position of the digit (from the right) where the iteration stopped at, when constructing a Semigreedy Catalan representation of n as described in A244159.

Links

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

Crossrefs

One less than A244316.

Cf. A000108, A007814, A176137, A197433, A244230, A244159.

Formula

a(0) = 0, and for n >= 1, if A176137(n) = 1, a(n) = A007814(A244230(n)), otherwise a(n) = a(n-A197433(A244230(n)-1)).