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!)
A265151 a(1) = 11, a(n) = smallest number > a(n-1) such that the concatenation of a(n-1) and a(n) is a square. 8
11, 56, 169, 744, 769, 5076, 5625, 43524, 390625, 1827776, 2562500, 8273225, 37136225, 38371001, 43037561, 258421444, 792669636, 2928667041, 38512058944, 260125180889, 405701529401, 688085041025, 5890084946609, 22508111494025, 64017148660004, 537387232526336 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
a(3) is 169 since it is the least number greater than a(2)=56 which concatenated with 56 forms a perfect square, i.e., 56169 = 237^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, 11, 25] (* after the algorithm of David W. Wilson in A090566 *)
CROSSREFS
Sequence in context: A041226 A042503 A223766 * A275643 A341405 A223773
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 23 23:26 EDT 2024. Contains 371917 sequences. (Running on oeis4.)