login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A159613 Palindromic primes with multiplicative persistence value 1. 1
11, 101, 131, 151, 181, 191, 313, 10301, 10501, 10601, 11311, 11411, 16061, 30103, 30203, 30403, 30703, 30803, 31013, 35053, 38083, 70207, 70507, 70607, 73037, 74047, 90709, 91019, 94049, 1003001, 1008001, 1022201, 1028201, 1035301 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

LINKS

Harvey P. Dale, Table of n, a(n) for n = 1..200

FORMULA

A002385 INTERSECT A046501. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 21 2009]

MAPLE

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: [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 21 2009]

MATHEMATICA

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

CROSSREFS

A046501

Cf. A056709. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 21 2009]

Sequence in context: A062696 A113654 A066592 * A062332 A088281 A068685

Adjacent sequences:  A159610 A159611 A159612 * A159614 A159615 A159616

KEYWORD

nonn,base

AUTHOR

Lekraj Beedassy (blekraj(AT)yahoo.com), Apr 17 2009

EXTENSIONS

Extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 21 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 09:54 EST 2012. Contains 205614 sequences.