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 A261101 #5 Aug 10 2015 07:33:47 %S A261101 0,1,2,3,4,4,5,5,6,6,6,7,7,7,7,7,8,8,8,8,8,8,8,8,9,9,9,9,9,9,9,9,9,9, %T A261101 9,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,11,11,11,11,11, %U A261101 11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12 %N A261101 After zero, each n occurs A261091(n) times. %H A261101 Antti Karttunen, <a href="/A261101/b261101.txt">Table of n, a(n) for n = 0..7624</a> %o A261101 (Scheme) (define (A261101 n) (let loop ((k 0)) (if (>= (A261081 k) n) k (loop (+ 1 k))))) %Y A261101 Auxiliary sequence for constructing A261102 and A219648. %Y A261101 Cf. A261081. %K A261101 nonn %O A261101 0,3 %A A261101 _Antti Karttunen_, Aug 09 2015