|
Search: id:A125840
|
|
|
| A125840 |
|
Two-sided multiplicative pointer primes. |
|
+0 2
|
|
| 1123, 21911, 3116111, 11413111, 12111331, 14111311, 316111111, 1111131821
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Following the definition of multiplicative pointer primes (A089823), I call a prime p a two-sided multiplicative pointer prime if previous_prime(p)=p-P and next_prime(p)=p+P where P is the product of the digits of p.
|
|
LINKS
|
Carlos Rivera and Joseph L. Pe, Pointer primes.
|
|
EXAMPLE
|
11112119111 is in the sequence because previous_prime(11112119111)
= 11112119111 - 1*1*1*1*2*1*1*9*1*1*1 and next_prime(11112119111)
= 11112119111 + 1*1*1*1*2*1*1*9*1*1*1.
|
|
MATHEMATICA
|
Do[p=Prime[m]; P=Apply[Times, IntegerDigits[p]]; If[Prime[m-1]== p-P&&Prime[m+1]==p+P, Print[p]], {m, 2, 140000000}]
|
|
CROSSREFS
|
Cf. A089823, A125841, A127836.
Sequence in context: A158729 A035859 A105310 this_sequence A069984 A104285 A082888
Adjacent sequences: A125837 A125838 A125839 this_sequence A125841 A125842 A125843
|
|
KEYWORD
|
hard,more,base,nonn
|
|
AUTHOR
|
Farideh Firoozbakht (mymontain(AT)yahoo.com), Feb 02 2007
|
|
|
Search completed in 0.002 seconds
|