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!)
A007488 Primes whose reversal is a square.
(Formerly M5321)
26

%I M5321 #63 Oct 30 2023 00:47:52

%S 61,163,487,691,1297,1861,4201,4441,4483,5209,5227,9049,9631,12391,

%T 14437,16141,16987,61483,63211,65707,65899,67057,69481,92767,94273,

%U 96979,106303,108061,123031,123373,125329,127291,129643,142771,146857,148249,165901

%N Primes whose reversal is a square.

%C Number of terms less than 10^k: 0, 0, 1, 4, 13, 26, 74, 213, 615, 1773, 5000, 14356, 41474, 120186, 352310, 1035235, ... - _Muniru A Asiru_, Jan 19 2018 and _David A. Corneth_, Jan 12 2019

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%D Charles W. Trigg, Primes with Reverses That Are Powers, J. Rec. Math., 17 (1985), 172-176.

%H David A. Corneth, <a href="/A007488/b007488.txt">Table of n, a(n) for n = 1..14356</a> (terms 1..1000 from T. D. Noe, terms 1001..1773 from Marius A. Burtea)

%e 61 is in the sequence because 16 = 4^2.

%e 163 is in the sequence because 361 = 19^2.

%e 167 is not in the sequence because 761 is also prime, not a square.

%p revdigs:= proc(n)

%p local L,nL,j;

%p L:= convert(n,base,10);

%p nL:= nops(L);

%p add(L[i]*10^(nL-i),i=1..nL);

%p end:

%p map(proc(i) local r; r:= revdigs(i^2); if isprime(r) then r else NULL fi end proc, {$1..9999}); # _Robert Israel_, Aug 14 2014

%t Select[Prime[Range[16000]], IntegerQ[Sqrt[ToExpression[StringReverse[ToString[#]]]]] &]

%t Select[Prime[Range[16000]], IntegerQ[Sqrt[FromDigits[ Reverse[ IntegerDigits[ #]]]]] &] (* _Harvey P. Dale_, Jul 19 2011 *)

%t Select[Prime@ Range[10^5], IntegerQ@ Sqrt@ IntegerReverse@ # &] (* _Michael De Vlieger_, Jan 20 2018 *)

%o (Python)

%o from gmpy2 import is_square

%o from sympy import prime

%o A007488 = [prime(n) for n in range(1,10**6) if is_square(int(str(prime(n))[::-1]))] # _Chai Wah Wu_, Aug 14 2014

%o (PARI) is(n)=isprime(n) && issquare(fromdigits(Vecrev(digits(n)))) \\ _Charles R Greathouse IV_, Feb 06 2017

%o (PARI) uptoQdigits(n) = {my(res=List(), i2); for(i=4, sqrtint(10^n), i2 = i^2; if(i%10!=0 && gcd(10, i2 \ (10^logint(i2, 10))) == 1, c=fromdigits(Vecrev(digits(i2))); if(isprime(c), listput(res,c) ) ) ); listsort(res); res } \\ _David A. Corneth_, Jan 12 2019

%o (Magma) [p: p in PrimesUpTo(150000)|IsSquare(Seqint(Reverse(Intseq(p))))];// _Marius A. Burtea_, Jan 12 2019

%Y Cf. A059007, A068989. See A132388 for another version.

%Y Primes whose reversal is a k-th power: A057699 (k=3), A058996 (k=4), A059000 (k=5), A059001 (k=6), A059002 (k=7), A059003 (k=8), A350363 (k=9), A059005 (k=10).

%K base,nonn,nice

%O 1,1

%A _N. J. A. Sloane_, _Robert G. Wilson v_

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 May 8 18:04 EDT 2024. Contains 372340 sequences. (Running on oeis4.)