|
| |
|
|
A217040
|
|
Bases b in which the increasing concatenation of all primes smaller than b forms a prime number.
|
|
0
|
| |
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
This sequence is a list of those bases that give prime values analogous to the prime 2357 in base 10.
Heuristically, this sequence should be infinite with approximately logarithmic density. - Charles R Greathouse IV, Sep 27 2012
|
|
|
LINKS
|
Table of n, a(n) for n=1..10.
|
|
|
EXAMPLE
|
2 is the only prime less than 3, and the improper 'concatenation' of this one term is prime, so 3 is in this sequence.
In base 4, the number represented as 23 is 2*4 + 3 = 11, a prime (so 4 is included in the list); the base-5 case, similarly, yields the prime 13, as represented in base 10; 6 is not on the list because 2*6^2+3*6+5=95 is composite; and so on.
|
|
|
PROG
|
(PARI) is(n)=isprime(subst(Pol(primes(primepi(n-1))), 'x, n)) \\ Charles R Greathouse IV, Sep 26 2012
(Python)
from sympy import primerange, isprime
def fromdigits(d, b):
n = 0
for di in d: n *= b; n += di
return n
def ok(b): return isprime(fromdigits([p for p in primerange(1, b)], b))
print([b for b in range(3, 700) if ok(b)]) # Michael S. Branicky, Mar 04 2021
|
|
|
CROSSREFS
|
Cf. A019518, A046035.
Sequence in context: A327178 A190211 A136120 * A295718 A035236 A047600
Adjacent sequences: A217037 A217038 A217039 * A217041 A217042 A217043
|
|
|
KEYWORD
|
nonn,base,hard,more
|
|
|
AUTHOR
|
James G. Merickel, Sep 25 2012
|
|
|
EXTENSIONS
|
a(10) from Charles R Greathouse IV, Sep 27 2012
|
|
|
STATUS
|
approved
|
| |
|
|
