A266113 a(n) = number of integers k <= n which are least siblings in A263267-tree (see A266114).

1, 1, 2, 2, 3, 4, 5, 6, 7, 7, 8, 8, 9, 10, 10, 10, 11, 12, 13, 14, 14, 15, 16, 17, 18, 18, 19, 19, 20, 20, 21, 22, 22, 23, 24, 24, 25, 26, 26, 27, 28, 28, 29, 30, 30, 31, 32, 32, 33, 34, 35, 35, 36, 36, 36, 37, 38, 39, 40, 40, 41, 42, 42, 42, 43, 43, 44, 45, 45, 45, 46, 47, 48, 49, 49, 49, 50, 50, 51, 51, 52, 53, 54, 55, 55

Offset: 1

Author

Antti Karttunen, Dec 21 2015

Keywords

• nonn

Comments

Partial sums of A266112.

The least monotonic left inverse of A266114.

Links

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

Crossrefs

Cf. A000005, A263267, A266112, A266114.

Formula

a(1) = 1; for n > 1, a(n) = A266112(n) + a(n-1).

Other identities. For all n >= 1:

a(A266114(n)) = n. [Works as a left inverse of A266114].