cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A159613 Palindromic primes with multiplicative persistence value 1.

Original entry on oeis.org

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
Offset: 1

Views

Author

Lekraj Beedassy, Apr 17 2009

Keywords

Crossrefs

Cf. A046501.
Cf. A056709. - R. J. Mathar, Apr 21 2009

Programs

  • 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: # R. J. Mathar, 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] (* Harvey P. Dale, Dec 16 2011 *)

Formula

A002385 INTERSECT A046501. - R. J. Mathar, Apr 21 2009

Extensions

Extended by R. J. Mathar, Apr 21 2009