A261093 a(n) = number of nonzero terms of A219640 <= n.

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

Offset

0,3

Comments

Each n occurs A261095(n) times.

Links

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

Formula

a(n) = the largest k such that A219640(k) <= n.

Other identities. For all n >= 0:

a(A219640(n)) = n.

Prog

(Scheme, with Antti Karttunen's IntSeq-library)
(define A261093 (LEFTINV-LEASTMONO-NC2NC 0 0 A219640))

Crossrefs

Left inverse of A219640. (A261094 gives the zeroed version).

Partial sums of A261092 summed from its term a(1) onward.

Sequence in context: A237638 A343205 A334483 * A306726 A188511 A064488

Adjacent sequences: A261090 A261091 A261092 * A261094 A261095 A261096

Keyword

nonn

Author

Antti Karttunen, Aug 08 2015

Status

approved