1,1

There are only two known primes in a(n): a(4) = 14639 and a(6) = 1771559 (see A128472 = smallest prime of the form (2n-1)^k - 2 for k>(2n-1), or 0 if no such number exists. 3 divides a(2k-1). 7 divides a(3k-1). 13 divides a(12k-5). 17 divides a(16k-14). Final digit of a(n) is 9. Final two digits of a(n) are periodic with period 10. Mod[a(n), 100] = {09, 19, 29, 39, 49, 59, 69, 79, 89, 99}. Final three digits of a(n) are periodic with period 50. Mod[a(n), 1000] = {009, 119, 329, 639, 049, 559, 169, 879, 689, 599, 609, 719, 929, 239, 649, 159, 769, 479, 289, 199, 209, 319, 529, 839, 249, 759, 369, 079, 889, 799, 809, 919, 129, 439, 849, 359, 969, 679, 489, 399, 409, 519, 729, 039, 449, 959, 569, 279, 089, 999}.

Henri Lifchitz & Renaud Lifchitz : PRP Records. Probable Primes Top 10000.

Cf. A001020, A024127, A034524. Cf. A104096 = Largest prime <= 11^n. Cf. A084714 = smallest prime of the form (2n-1)^k - 2, or 0 if no such number exists. Cf. A128472 = smallest prime of the form (2n-1)^k - 2 for k>(2n-1), or 0 if no such number exists. Cf. A014224, A109080, A090669, A128455, A128457, A128458, A128459, A128460, A128461.

Sequence in context: A051617 A166823 A087984 this_sequence A054051 A159660 A061172

Adjacent sequences: A130649 A130650 A130651 this_sequence A130653 A130654 A130655

nonn

Alexander Adamchuk (alex(AT)kolmogorov.com), Jun 20 2007