|
| |
|
|
A058264
|
|
Smallest prime p of two consecutive primes, p < q, such that GCD( p-1, q-1 ) = 2n.
|
|
0
| |
|
|
3, 13, 31, 89, 181, 661, 113, 2113, 523, 13421, 2311, 4177, 35543, 39901, 4831, 44417, 1327, 12853, 119321, 52321, 82657, 36389, 136897, 203713, 95651, 59281, 255259, 178697, 531919, 427621, 2640581, 1414849, 643303, 3021173, 175141
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Since all consecutive primes, p < q and p greater than 2, are odd, therefore GCD( p-1, q-1 ) must be even.
|
|
|
EXAMPLE
| n = 49: a(49) = 604073 because GCD[604073-1,604171-1] = GCD[6164.98,6165.98] = 98 = 2n. For n = 4, a(4) = 89 because GCD[89-1,97-1] = GCD[8.11,8.16] = 8 = 2n and these primes are the smallest with this property.
|
|
|
MATHEMATICA
| a = Table[0, {100}]; p = 3; q = 5; Do[q = Prime[n + 1]; d = GCD[p - 1, q - 1]/2; If[d < 101 && a[[d]] == 0, a[[d]] = n]; b = c, {n, 2, 10^7}]; a
|
|
|
CROSSREFS
| Cf. A006093, A067605.
Sequence in context: A147134 A146842 A146191 * A034050 A107689 A154834
Adjacent sequences: A058261 A058262 A058263 * A058265 A058266 A058267
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Labos E. (labos(AT)ana.sote.hu), Dec 06 2000
|
|
|
EXTENSIONS
| Edited by Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 01 2002
|
| |
|
|
