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

%I #18 Jul 26 2024 00:14:59

%S 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,

%T 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,

%U 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

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

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

%C Auxiliary function for computing A179016.

%H Antti Karttunen, <a href="/A213711/b213711.txt">Table of n, a(n) for n = 0..8727</a>

%o (MIT/GNU Scheme with _Antti Karttunen_'s intseq-library): (define A213711 (LEAST-GTE-I 0 0 A218600))

%Y Cf. A179016, A213709, A218600.

%K nonn

%O 0,3

%A _Antti Karttunen_, Oct 26 2012

%E Starting offset changed from 1 to 0. - _Antti Karttunen_, Nov 05 2012