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!)
A159613 Palindromic primes with multiplicative persistence value 1. 1

%I #9 Feb 06 2019 00:00:31

%S 11,101,131,151,181,191,313,10301,10501,10601,11311,11411,16061,30103,

%T 30203,30403,30703,30803,31013,35053,38083,70207,70507,70607,73037,

%U 74047,90709,91019,94049,1003001,1008001,1022201,1028201,1035301

%N Palindromic primes with multiplicative persistence value 1.

%H Harvey P. Dale, <a href="/A159613/b159613.txt">Table of n, a(n) for n = 1..200</a>

%F A002385 INTERSECT A046501. - _R. J. Mathar_, Apr 21 2009

%p isA002113 := proc(n) local dgs,i ; dgs := convert(n,base,10) ; for i from 1 to nops(dgs)/2 do if op(i,dgs) <> op(-i,dgs) then RETURN(false): fi; od: RETURN(true) ; end: ndigs := proc(n) max(1, ilog10(n)+1) ; end: A031346 := proc(n) local p,nred; p := 0 ; nred := n ; while ndigs(nred) > 1 do nred := mul(d, d=convert(nred,base,10) ) ; p := p+1 ; od: p ; end: isA159613 := proc(n) RETURN(isprime(n) and isA002113(n) and A031346(n) = 1) ; end: for n from 1 to 100000 do p := ithprime(n) ; if isA159613(p) then printf("%d,",p) ; fi; od: # _R. J. Mathar_, Apr 21 2009

%t palpQ[n_]:=Module[{idn=IntegerDigits[n]},idn==Reverse[idn] && Length[ NestWhileList[Times@@IntegerDigits[#]&,n,#>9&]]==2]; Select[Prime[ Range[82000]],palpQ] (* _Harvey P. Dale_, Dec 16 2011 *)

%Y Cf. A046501.

%Y Cf. A056709. - _R. J. Mathar_, Apr 21 2009

%K nonn,base

%O 1,1

%A _Lekraj Beedassy_, Apr 17 2009

%E Extended by _R. J. Mathar_, Apr 21 2009

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 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)