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

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

A217309, A218600.

Sequence in context: A163515 A220348 A274010 * A072649 A266082 A105195

Adjacent sequences: A213708 A213709 A213710 * A213712 A213713 A213714

Keyword

nonn

Author

Antti Karttunen, Oct 26 2012

Extensions

Starting offset changed from 1 to 0. - Antti Karttunen, Nov 05 2012

Status

approved