|
|
A209834
|
|
a(A074773(n) mod 1519829 mod 18) = A074773(n), 1 <= n <= 18.
|
|
2
|
|
|
3343433905957, 1871186716981, 307768373641, 546348519181, 1362242655901, 2273312197621, 354864744877, 3474749660383, 2366338900801, 602248359169, 3215031751, 2152302898747, 315962312077, 457453568161, 528929554561, 3477707481751, 118670087467, 3461715915661
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
From the first reference, for numbers up to 10^12 only four strong pseudoprimality tests (with bases 2, 13, 23, 1662803) are necessary for proving primality. Since A074773(19) = 4341937413061, up to 4.10^12 we can use the four bases 2, 3, 5, 7 and if a number n passes the tests, we check if n is equal to a(n mod 1519829 mod 18). If not, n is prime. A unique comparison is used so we have a primality test equally efficient for an interval four times larger. See the Bomfim link.
Terms computed using table by Charles R Greathouse IV. See A074773.
|
|
LINKS
|
|
|
EXAMPLE
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,fini,full
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|