|
|
A227371
|
|
Numbers n such that prime(n) + reversal(prime(n)) is a square.
|
|
2
|
|
|
1, 10, 15, 23, 56, 89, 2279, 2581, 2683, 6329, 7845, 7942, 26074, 26146, 26290, 26651, 26871, 27080, 27960, 28687, 28898, 29396, 29539, 29824, 30038, 30333, 30404, 30472, 30955, 31025, 31097, 31168, 32076, 32143, 32429, 33502, 33564, 41608, 42011, 42148, 42696
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
See A059799 for the sequence of prime numbers.
|
|
LINKS
|
|
|
EXAMPLE
|
a(2)=10: prime(10)=29. Reversing digits gives 92. 29+92 = 121 = 11^2.
|
|
MAPLE
|
with(StringTools):
K := proc(n) local a, b, d, e; a :=ithprime(n): b:=parse(Reverse(convert((a), string))): d:=a+b; e:=evalf(sqrt(d)); if e=floor(e) then RETURN (n) fi:
end:
with(StringTools):
K:=proc()local n, a, b, c, d, e; c:=1; for n from 1 to 2000000 do; a:=ithprime(n); b:=parse(Reverse(convert((a), string))); d:=a+b; e:=evalf(sqrt(d)); if e=floor(e) then lprint(c, n); c:=c+1; fi; od; end: K(); # K. D. Bajpai, Jul 08 2013
|
|
MATHEMATICA
|
Select[Range[50000], IntegerQ[Sqrt[Prime[#]+IntegerReverse[Prime[#]]]]&] (* The program uses the IntegerReverse function from Mathematica version 10 *) (* Harvey P. Dale, Jan 24 2016 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|