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 A025485 #15 Dec 19 2016 01:29:04 %S A025485 0,0,0,1,1,2,2,1,1,1,3,3,2,2,1,1,1,2,2,3,3,2,2,1,1,1,4,2,2,2,3,3,2,2, %T A025485 1,1,1,3,4,4,2,2,2,3,3,2,2,1,1,1,2,3,3,4,4,2,2,2,3,3,2,2,1,1,1,2,2,2, %U A025485 3,3,4,4,2,2,2,3,3,2,2,1,1,1,3,3,2,2,2,3,3,4,4,2,2,2,3,3,2,2,1,1,1,4,4,3,3,2,2,2 %N A025485 Number of iterations of function f(k) = ceiling(sqrt(k))^2 - k on n required to force n <= 2. %H A025485 David W. Wilson, <a href="/A025485/b025485.txt">Table of n, a(n) for n = 0..1000</a> %K A025485 nonn %O A025485 0,6 %A A025485 _David W. Wilson_ %E A025485 Corrected and extended by _David W. Wilson_, Feb 28 2013