|
Search: id:A128461
|
|
|
| A128461 |
|
Numbers n such that 21^n - 2 is a prime. |
|
+0
10
|
|
| 1, 2, 4, 10, 21, 25, 27, 32, 60, 88, 106, 120, 146, 264, 828, 965
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
MATHEMATICA
|
Do[ f = 21^n - 2; If[ PrimeQ[ f ], Print[ {n, f} ] ], {n, 1, 1000} ]
|
|
CROSSREFS
|
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.
Sequence in context: A104433 A104432 A129211 this_sequence A011956 A018003 A065023
Adjacent sequences: A128458 A128459 A128460 this_sequence A128462 A128463 A128464
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Mar 14 2007
|
|
EXTENSIONS
|
2 more terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), May 05 2007
|
|
|
Search completed in 0.002 seconds
|
