A261093 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

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

(list; graph; refs; listen; history; text; internal format)

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