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".
0, 1, 3, 4, 9, 10, 11, 12, 13, 16, 25, 36, 49, 64, 65, 66, 81, 82, 83, 84, 85, 86, 87, 88, 89, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153
Offset: 0
Links
- Ivan Neretin, Table of n, a(n) for n = 0..10000
- B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence, J. Integer Seqs., Vol. 6 (2003), #03.2.2.
- B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence (math.NT/0305308)
- Index entries for sequences of the a(a(n)) = 2n family
Programs
-
Mathematica
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 *)
Comments