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 A094763 #9 Jan 28 2018 02:42:21
%S A094763 2,3,5,6,8,12,15,21,26,27,29,33,41,46,56,63,77,90,99,117,134,147,150,
%T A094763 156,168,192,215,234,243,261,266,276,296,303,317,345,366,371,381,401,
%U A094763 402,404,408,416,432,464,487,490,496,508,532,535,541,553,577,578,580,584,592,608
%N A094763 Trajectory of 2 under repeated application of the map n -> n + square excess of n.
%H A094763 Robert Israel, <a href="/A094763/b094763.txt">Table of n, a(n) for n = 0..10000</a>
%H A094763 S. H. Weintraub, <a href="http://www.jstor.org/stable/4145074">An interesting recursion</a>, Amer. Math. Monthly, 111 (No. 6, 2004), 528-530.
%p A094763 a[0]:= 2:
%p A094763 for n from 1 to 100 do a[n]:= f(a[n-1]) od:
%p A094763 seq(a[n],n=0..100); # _Robert Israel_, Jan 28 2018
%o A094763 (PARI) lista(nn) = {print1(n=2, ", "); for (k=2, nn, m = 2*n - sqrtint(n)^2; print1(m, ", "); n = m;);} \\ _Michel Marcus_, Oct 23 2015
%Y A094763 Cf. A053186, A094761, A094764.
%K A094763 nonn
%O A094763 0,1
%A A094763 _N. J. A. Sloane_, Jun 10 2004