[go: up one dir, main page]

login
Revision History for A265149 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
a(1) = 8, a(n) = smallest number > a(n-1) such that the concatenation of a(n-1) and a(n) is a square.
(history; published version)
#9 by Bruno Berselli at Fri Oct 13 03:30:59 EDT 2017
STATUS

reviewed

approved

#8 by Michel Marcus at Fri Oct 13 00:52:40 EDT 2017
STATUS

proposed

reviewed

#7 by Jon E. Schoenfield at Fri Oct 13 00:11:23 EDT 2017
STATUS

editing

proposed

#6 by Jon E. Schoenfield at Fri Oct 13 00:11:19 EDT 2017
EXAMPLE

a(3) is 209 since it is the least number greater than 41, a(2), =41 which concatenated with 41 forms a perfect square, i.e.; , 41209 = 203^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, 8, 25] (* after the algorithm of _David W. Wilson _ in A090566 *)

STATUS

approved

editing

#5 by N. J. A. Sloane at Thu Dec 03 04:39:42 EST 2015
STATUS

editing

approved

#4 by N. J. A. Sloane at Thu Dec 03 04:39:39 EST 2015
KEYWORD

nonn,changed,base

STATUS

proposed

editing

#3 by Robert G. Wilson v at Wed Dec 02 21:49:33 EST 2015
STATUS

editing

proposed

Discussion
Thu Dec 03
03:04
Michel Marcus: keyword base
#2 by Robert G. Wilson v at Wed Dec 02 21:33:29 EST 2015
NAME

allocated for Robert Ga(1) = 8, a(n) = smallest number > a(n-1) such that the concatenation of a(n-1) and a(n) is a square. Wilson v

DATA

8, 41, 209, 764, 5225, 8441, 9344, 63761, 82201, 477264, 3191044, 4038489, 34656049, 61233321, 271005625, 3465072801, 36565416324, 83511106624, 222222321476, 425286636356, 2743260628100, 9534841632400, 33984728488004, 128198574830929, 741089622057984, 5579432351776489

OFFSET

1,1

EXAMPLE

a(3) is 209 since it is the least number greater than 41, a(2), which concatenated with 41 forms a perfect square, i.e.; 41209 = 203^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, 8, 25] (* after the algorithm of David W. Wilson in A090566 *)

KEYWORD

allocated

nonn

AUTHOR

Robert G. Wilson v, Dec 02 2015

STATUS

approved

editing

#1 by Robert G. Wilson v at Wed Dec 02 21:18:17 EST 2015
NAME

allocated for Robert G. Wilson v

KEYWORD

allocated

STATUS

approved