This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A213711 #18 Jul 26 2024 00:14:59 %S A213711 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 A213711 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 A213711 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 A213711 a(n) = minimal k for which A218600(k) >= n. %C A213711 a(0)=0, and after that each term n occurs A213709(n-1) times. %C A213711 Auxiliary function for computing A179016. %H A213711 Antti Karttunen, <a href="/A213711/b213711.txt">Table of n, a(n) for n = 0..8727</a> %o A213711 (MIT/GNU Scheme with _Antti Karttunen_'s intseq-library): (define A213711 (LEAST-GTE-I 0 0 A218600)) %Y A213711 Cf. A179016, A213709, A218600. %K A213711 nonn %O A213711 0,3 %A A213711 _Antti Karttunen_, Oct 26 2012 %E A213711 Starting offset changed from 1 to 0. - _Antti Karttunen_, Nov 05 2012