A253783 a(1) = 0; for n>1: a(n) = A075167(1+A071178(n)) + (A061395(n) - A061395(A051119(n))) + a(A051119(n)).

0, 2, 3, 3, 4, 4, 5, 3, 4, 5, 6, 5, 7, 6, 5, 4, 8, 5, 9, 6, 6, 7, 10, 5, 5, 8, 4, 7, 11, 6, 12, 4, 7, 9, 6, 6, 13, 10, 8, 6, 14, 7, 15, 8, 6, 11, 16, 6, 6, 6, 9, 9, 17, 5, 7, 7, 10, 12, 18, 7, 19, 13, 7, 5, 8, 8, 20, 10, 11, 7, 21, 6, 22, 14, 6, 11, 7, 9, 23, 7, 5, 15, 24, 8, 9, 16, 12, 8, 25, 7, 8, 12, 13, 17, 10, 6, 26, 7, 8, 7, 27, 10, 28

Offset: 1

Author

Antti Karttunen, Jan 16 2015

Keywords

• nonn

Comments

An auxiliary recurrence for computing A075167.

Links

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

Crossrefs

Cf. A051119, A061395, A075167, A071178.

Cf. also A106490.

Formula

a(1) = 0; for n>1: a(n) = A075167(1+A071178(n)) + (A061395(n) - A061395(A051119(n))) + a(A051119(n)).