|
Search: id:A073605
|
|
|
| A073605 |
|
Smallest number m such that m + k == 0 mod k-th prime for all k from 1 to n. |
|
+0
3
|
|
| 1, 1, 7, 157, 787, 787, 210997, 5316097, 34415167, 703693777, 194794490677, 5208806743927, 138782093170507, 5006786309605867, 253579251611336437, 12551374903381164637, 142908008812141343557, 77053322014980646906357
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
EXAMPLE
|
a(5) = 787 as 788, 789, 790, 791 and 792 are divisible by 2, 3, 5,7 and 11 respectively.
|
|
MATHEMATICA
|
Needs["NumberTheory`NumberTheoryFunctions`"]; Table[ ChineseRemainder[ Table[i, {i, 0, -n + 1, -1}], Table[ Prime[i], {i, 1, n}]] - 1, {n, 2, 18} ]
|
|
CROSSREFS
|
Adjacent sequences: A073602 A073603 A073604 this_sequence A073606 A073607 A073608
Sequence in context: A141835 A111831 A139226 this_sequence A115866 A009703 A014385
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 04 2002
|
|
EXTENSIONS
|
Edited, corrected and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 05 2002
|
|
|
Search completed in 0.002 seconds
|
