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

Author

Antti Karttunen, Oct 26 2012

Keywords

• nonn

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

Crossrefs

Cf. A179016, A213709, A218600.

Extensions

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