OFFSET
1,1
COMMENTS
Let p = n-th prime. Write p in base k, k=2,3,4,5,..., and stop when the result is a prime when looked at in base 10. - N. J. A. Sloane, Jan 25 2014
LINKS
Peter J. C. Moses, Table of n, a(n) for n = 1..2000
EXAMPLE
Let n=10, then prime(n)=29 (in base 10). The representations of 29 in bases 2,3,4,...,10 are 11101,1002,131,...,29 respectively. In this list 131 is the first and therefore the maximal prime. Thus a(10)=131.
MATHEMATICA
Map[First[First[Select[Map[{#, PrimeQ[#]}&, Map[FromDigits, IntegerDigits[Prime[#], Range[2, 10]]]], #[[2]]==True&]]]&, Range[50]]
Table[SelectFirst[Table[FromDigits[IntegerDigits[Prime[n], b]], {b, 2, 10}], PrimeQ], {n, 80}] (* Harvey P. Dale, May 17 2024 *)
PROG
(PARI)
base_b(n, b) = {
my(s=[], r, x);
while(n>0,
r = n%b;
n = n\b;
s = concat(r, s)
);
x=10;
eval(Pol(s))
}
A236174(maxp) = {
my(s=[], b, t);
forprime(p=2, maxp,
for(b=2, 10,
t=base_b(p, b);
if(isprime(t), s=concat(s, t); break)
)
);
s
} \\ Colin Barker, Jan 23 2014
(Python)
from sympy import prime, isprime
def A236174(n):
....p = prime(n)
....for b in range(2, 11):
........x, y, z = p, 0, 1
........while x >= b:
............x, r = divmod(x, b)
............y += r*z
............z *= 10
........y += x*z
........if isprime(y):
............return y # Chai Wah Wu, Jan 03 2015
CROSSREFS
KEYWORD
nonn,base,nice
AUTHOR
Vladimir Shevelev, Jan 19 2014
STATUS
approved