|
Search: id:A126659
|
|
|
| A126659 |
|
Least number k>0 such that ((2n-1)^k + 1)/(2n) is prime, or 0 if no such prime exists. |
|
+0
2
|
|
| 3, 5, 3, 3, 5, 3, 3, 7, 17, 3, 11, 3, 0, 7, 109, 5, 11, 5, 3, 17, 5, 103, 5, 7, 3, 21943, 3, 53, 17, 7, 3, 19, 3, 11, 5, 7, 5, 37, 3, 3, 19, 167, 7, 13, 3, 89, 43
(list; graph; listen)
|
|
|
OFFSET
|
2,1
|
|
|
COMMENT
|
All terms are odd primes.
|
|
LINKS
|
H. Dubner and T. Granlund, Primes of the Form (b^n+1)/(b+1), J. Integer Sequences, 3 (2000), #P00.2.7.
Eric Weisstein's World of Mathematics, Repunit.
|
|
FORMULA
|
a(n) = A084742(2n-1).
|
|
CROSSREFS
|
Cf. A084741, A084742, A125954, A125958.
Sequence in context: A135514 A092553 A112755 this_sequence A102294 A021287 A124887
Adjacent sequences: A126656 A126657 A126658 this_sequence A126660 A126661 A126662
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 09 2007, Feb 10 2007
|
|
|
Search completed in 0.002 seconds
|
