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 A084520 #8 Jul 29 2017 13:05:08 %S A084520 0,1,2,2,3,3,3,4,4,4,5,5,5,6,6,6,6,7,7,7,7,8,8,8,8,9,9,9,9,10,10,10, %T A084520 10,11,11,11,11,12,12,12,12,13,13,13,13,14,14,14,14,15,15,15,15,16,16, %U A084520 16,16,17,17,17,17,18,18,18,18,18,19,19,19,19,19,20,20,20,20,20,21,21,21 %N A084520 a(0)=0, after which each n occurs A084526(n) times. %C A084520 Also minimum i such that A084525(i) >= n. Tells that the n-th throw (n>=1) in A084521 belongs to the a(n)-th lexicographical solution A084522(a(n)). %H A084520 A. Karttunen, <a href="/A084507/a084507.scm.txt">Scheme-program for computing this sequence</a> %Y A084520 Differs from A084510 first time at the 65th term, where A084510(65) = 19, while A084520(65) = 18. Cf. A084500. %K A084520 nonn %O A084520 0,3 %A A084520 _Antti Karttunen_, Jun 02 2003