|
Search: id:A077338
|
|
|
| A077338 |
|
a(n) = smallest multiple of prime(n) such that a(n) +1 is a multiple of prime(n+1). |
|
+0
1
|
|
| 2, 9, 20, 21, 77, 169, 170, 114, 115, 464, 961, 1147, 902, 516, 423, 530, 1829, 3416, 1206, 2627, 4818, 1659, 1245, 7565, 7372, 5252, 2781, 5885, 9265, 13334, 4191, 3013, 9590, 2085, 11324, 19781, 21352, 6846, 4843, 5190, 16289, 31132, 18527, 28564
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
a(5) = 77 as prime(5) = 11,77 = 11*7 and 78 = 6*13= a multiple of prime(6).
|
|
MATHEMATICA
|
Do[k = 1; While[Mod[k*Prime[n] + 1, Prime[n+1]] != 0, k++ ]; Print[k*Prime[n]], {n, 1, 50}] (Propper)
|
|
CROSSREFS
|
Sequence in context: A038249 A116014 A090939 this_sequence A047883 A042915 A007115
Adjacent sequences: A077335 A077336 A077337 this_sequence A077339 A077340 A077341
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Nov 04 2002
|
|
EXTENSIONS
|
More terms from Ryan Propper (rpropper(AT)stanford.edu), Jul 09 2005
|
|
|
Search completed in 0.002 seconds
|
