|
Search: id:A058998
|
|
|
| A058998 |
|
Least power k for which n^k reversed is a prime, or 0 if impossible. |
|
+0
1
|
|
| 0, 1, 0, 2, 1, 0, 1, 8, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 2, 0, 0, 0, 8, 0, 13, 47, 0, 2, 7, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 2, 0, 5, 0, 0, 22, 15, 0, 6, 0, 0, 3, 10, 0, 0, 143, 0, 88, 12, 0, 4, 2, 0, 4, 8, 0, 39, 83, 0, 0, 1, 0, 1, 1, 0
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
MATHEMATICA
|
Do[ If[ Mod[ n, 3 ] != 0 && Mod[ n, 10 ] != 0 && Mod[ n, 11 ] != 0, k = 1; While[ !PrimeQ[ ToExpression[ StringReverse[ ToString[ n^k ] ] ] ], k++ ]; Print[ k ], Print[ 0 ] ], {n, 2, 75} ]
|
|
CROSSREFS
|
Sequence in context: A108723 A011126 A076422 this_sequence A085324 A062154 A110399
Adjacent sequences: A058995 A058996 A058997 this_sequence A058999 A059000 A059001
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com), Jan 17 2001
|
|
|
Search completed in 0.002 seconds
|
