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 A276611 #5 Sep 08 2016 17:53:26 %S A276611 0,1,2,2,2,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5, %T A276611 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, %U A276611 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,8,9 %N A276611 After a(0)=0, each n occurs A261229(n) times. %C A276611 Auxiliary function for computing A276612 & A276613. %H A276611 Antti Karttunen, <a href="/A276611/b276611.txt">Table of n, a(n) for n = 0..10236</a> %o A276611 (Scheme) (define (A276611 n) (let loop ((k 0)) (if (>= (A261228 (+ 1 k)) n) k (loop (+ 1 k))))) %Y A276611 Cf. A261228, A261229, A276612, A276613. %K A276611 nonn %O A276611 0,3 %A A276611 _Antti Karttunen_, Sep 07 2016