|
|
A045878
|
|
Numbers k such that rotating digits of k^2 left once still yields a square.
|
|
4
|
|
|
1, 2, 3, 12, 14, 25, 108, 122, 216, 310, 1222, 2028, 2527, 3042, 11802, 12222, 13704, 24865, 25185, 26053, 30494, 122222, 208148, 247137, 312222, 1125786, 1222222, 1325080, 2084388, 2551071, 3025794, 3037736, 3126582, 10716846, 10787208
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Squares resulting in leading zeros are excluded.
|
|
LINKS
|
|
|
EXAMPLE
|
11303148^2 = {1}27761154709904 -> 277611547099041{1} = 16661679^2.
|
|
MATHEMATICA
|
rlsQ[n_]:=Module[{idnrl=RotateLeft[IntegerDigits[n^2]]}, First[idnrl]>0 && IntegerQ[Sqrt[FromDigits[idnrl]]]]; Select[Range[11000000], rlsQ] (* Harvey P. Dale, Nov 03 2013 *)
|
|
PROG
|
(Python)
from itertools import count, islice
from sympy.solvers.diophantine.diophantine import diop_DN
def A045878_gen(): # generator of terms
for l in count(0):
l1, l2 = 10**(l+1), 10**l
yield from sorted(set(abs(y) for z in (diop_DN(10, m*(1-l1)) for m in range(10)) for x, y in z if l1 >= x**2 >= l2))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|