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 A079258 #16 Jul 09 2015 18:19:30
%S A079258 0,1,3,4,9,10,11,12,13,16,25,36,49,64,65,66,81,82,83,84,85,86,87,88,
%T A079258 89,100,101,102,103,104,105,106,107,108,109,110,121,122,123,124,125,
%U A079258 126,127,128,129,130,131,132,133,144,145,146,147,148,149,150,151,152,153
%N A079258 a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is a square".
%C A079258 Also, a(n) is smallest nonnegative integer which is consistent with sequence being monotonically increasing and satisfying a(a(n)) = n^2.
%H A079258 Ivan Neretin, <a href="/A079258/b079258.txt">Table of n, a(n) for n = 0..10000</a>
%H A079258 B. Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL6/Cloitre/cloitre2.html">Numerical analogues of Aronson's sequence</a>, J. Integer Seqs., Vol. 6 (2003), #03.2.2.
%H A079258 B. Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="http://arXiv.org/abs/math.NT/0305308">Numerical analogues of Aronson's sequence</a> (math.NT/0305308)
%H A079258 <a href="/index/Aa#aan">Index entries for sequences of the a(a(n)) = 2n family</a>
%t A079258 a = {1, 3}; Do[AppendTo[a, If[MemberQ[a, n], Position[a, n][[1, 1]]^2, a[[-1]] + 1]], {n, 3, 58}]; Prepend[a, 0] (* _Ivan Neretin_, Jul 09 2015 *)
%Y A079258 See A079000, A079253, A079254, A079256, A079257 for similar sequences.
%K A079258 nonn,easy,look
%O A079258 0,3
%A A079258 _N. J. A. Sloane_ and _Matthew Vandermast_, Feb 04 2003