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 A094764 #10 Mar 03 2022 12:43:49
%S A094764 7,10,11,13,17,18,20,24,32,39,42,48,60,71,78,92,103,106,112,124,127,
%T A094764 133,145,146,148,152,160,176,183,197,198,200,204,212,228,231,237,249,
%U A094764 273,290,291,293,297,305,321,353,382,403,406,412,424,448,455,469,497,510,536,543
%N A094764 Trajectory of 7 under repeated application of the map n --> n + square excess of n.
%D A094764 H. Brocard, Note 2837, L'Intermédiaire des Mathématiciens, 11 (1904), p. 239.
%H A094764 S. H. Weintraub, <a href="http://www.jstor.org/stable/4145074">An interesting recursion</a>, Amer. Math. Monthly, 111 (No. 6, 2004), 528-530.
%o A094764 (PARI) lista(nn) = {print1(n=7, ", "); for (k=2, nn, m = 2*n - sqrtint(n)^2; print1(m, ", "); n = m;);} \\ _Michel Marcus_, Oct 24 2015
%Y A094764 Cf. A053186, A094761, A094763.
%K A094764 nonn
%O A094764 0,1
%A A094764 _N. J. A. Sloane_, Jun 10 2004