A213711 - OEIS

A213711

a(n) = minimal k for which A218600(k) >= n.

0, 1, 2, 3, 3, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9

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

OFFSET

0,3

COMMENTS

a(0)=0, and after that each term n occurs A213709(n-1) times.

Auxiliary function for computing A179016.

LINKS

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

PROG

(MIT/GNU Scheme with Antti Karttunen's intseq-library): (define A213711 (LEAST-GTE-I 0 0 A218600))

CROSSREFS

Cf. A179016, A213709, A218600.