login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
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 *)
CROSSREFS
Sequence in context: A156166 A064125 A089031 * A033587 A189807 A009942
KEYWORD
nonn,base
AUTHOR
Robert G. Wilson v, Dec 02 2015
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 11:14 EDT 2024. Contains 371936 sequences. (Running on oeis4.)