|
Search: id:A084738
|
|
|
| A084738 |
|
Smallest prime of the form (n^k-1)/(n-1), or 0 if no such prime exists. |
|
+0
5
|
|
| 3, 13, 5, 31, 7, 2801, 73, 0, 11, 50544702849929377, 13, 30941, 211, 241, 17, 307, 19, 109912203092239643840221, 421, 463, 23, 292561, 601, 0, 321272407, 757, 29, 732541, 31, 917087137, 0, 1123, 2458736461986831391
(list; graph; listen)
|
|
|
OFFSET
|
2,1
|
|
|
COMMENT
|
As mentioned by Dubner, when n is a power (greater than 1) of a prime, then (n^k-1)/(n-1) will usually be composite for all k, which is the case for n = 9, 25, 32, and 49. - T. D. Noe (noe(AT)sspectra.com), Jan 23 2004
|
|
REFERENCES
|
H. Dubner, Generalized repunit primes, Math. Comp., 61 (1993), 927-930.
|
|
EXAMPLE
|
a(8) = 73 = (8^3-1)/(8-1).
|
|
CROSSREFS
|
Cf. A076481.
Cf. A084740 (least k such that (n^k-1)/(n-1) is prime).
Sequence in context: A128368 A050089 A125571 this_sequence A073580 A140445 A012789
Adjacent sequences: A084735 A084736 A084737 this_sequence A084739 A084740 A084741
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy and Meenakshi Srikanth (amarnath_murthy(AT)yahoo.com), Jun 15 2003
|
|
EXTENSIONS
|
More terms from T. D. Noe (noe(AT)sspectra.com), Jan 23 2004
|
|
|
Search completed in 0.002 seconds
|
