|
|
A232448
|
|
Indices of Belphegor primes: numbers k such that the decimal number 1 0...0(k 0's) 666 0...0(k 0's) 1 (i.e., A232449(k)) is prime.
|
|
6
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
The resulting primes might be called Belphegor primes, after Pickover (see link). - N. J. A. Sloane, Dec 14 2015
I suspect the larger numbers only correspond to probable primes. - N. J. A. Sloane, Oct 16 2018
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
0 is in the sequence because A232449(0) = 16661 is prime.
13 is in the sequence because A232449(13) = 1000000000000066600000000000001 is prime.
For k = 1..12, A232449(k) is composite.
42 is in the sequence because 10000000000000000000000000000000000000000006660000000000000000000000000000\
|
|
MATHEMATICA
|
lst = {}; Do[p = 10^(2*n + 4) + 666*10^(n + 1) + 1; If[PrimeQ[p], Print[n]], {n, 0, 3000}]; (* Nathaniel Johnston, Nov 25 2013 *)
|
|
PROG
|
(PARI) default(factor_proven, 1);
Belphegor(k)=(10^(k+3)+666)*10^(k+1)+1;
for (an=0, 10000,
if (isprime(Belphegor(an)), print("Found: ", an),
if (an%100==0, print("Tested up to: ", an)))
);
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more,hard
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|