login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A265152
a(1) = 14, a(n) = smallest number > a(n-1) such that the concatenation of a(n-1) and a(n) is a square.
8
14, 44, 89, 401, 956, 6649, 17796, 58596, 432489, 4211044, 22847241, 34268944, 85740489, 530152900, 718608036, 3266783209, 33250749225, 96733442161, 617288020224, 5959324297569, 20015258667081, 123104551223296, 420105398760804, 552382701059344, 967075372931216
OFFSET
1,1
EXAMPLE
a(3) is 89 since it is the least number greater than a(2)=44 which concatenated with 44 forms a perfect square, i.e., 4489 = 67^2.
MATHEMATICA
f[n_] := Block[{x = n, d = 1 + Floor@ Log10@ n}, q = (Floor@ Sqrt[(10^d + 1) x] + 1)^2; If[q < (10^d) (x + 1), Mod[q, 10^d], Mod[(Floor@ Sqrt[(10^d)(10x + 1) - 1] + 1)^2, 10^(d + 1)] ]]; NestList[f, 14, 24] (* after the algorithm of David W. Wilson in A090566 *)
KEYWORD
nonn,base
AUTHOR
Robert G. Wilson v, Dec 02 2015
STATUS
approved