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 A276621 #5 Sep 12 2016 17:03:07 %S A276621 0,1,2,2,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5, %T A276621 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6, %U A276621 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6 %N A276621 After a(0)=0, each n occurs A261234(n-1) times. %C A276621 Auxiliary function for computing A276622 & A276623. %H A276621 Antti Karttunen, <a href="/A276621/b276621.txt">Table of n, a(n) for n = 0..6250</a> %o A276621 (Scheme) (define (A276621 n) (let loop ((k 0)) (if (>= (A261233 k) n) k (loop (+ 1 k))))) %Y A276621 Cf. A261233, A276622, A276623. %Y A276621 After a(0), a(n) differs from A111393(n+1) for the first time at n=46, where a(46)=5, while A111393(47)=6. %K A276621 nonn,base %O A276621 0,3 %A A276621 _Antti Karttunen_, Sep 11 2016