|
Search: id:A157752
|
|
|
| A157752 |
|
a(n) = smallest integer m == p_i (mod p_(i+1)), i=1..n; p_i = i-th prime. |
|
+0
1
|
|
| 2, 8, 68, 1118, 2273, 197468, 1728998, 1728998, 447914738, 10152454583, 1313795640428, 97783391392958, 5726413266646343, 38433316595821418, 15103232990013860963, 943894249589930135768, 52858423703753671390658
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Suggested by Chinese Remainder Theorem.
a(n) is prime for n = 1, 5, 10, 23, 30.
|
|
MATHEMATICA
|
a[n_] := ChineseRemainder[Prime[Range[n]], Prime[Range[2, n + 1]]] a[ # ] & /@ Range[30]
|
|
PROGRAM
|
(PARI) x=Mod(1, 1); for(i=1, 20, x=chinese(x, Mod(prime(i), prime(i+1))); print1(component(x, 2), ", "))
|
|
CROSSREFS
|
Cf. A053664 Smallest number m such that m = i mod prime_i for 1<=i<=n. A071057 Smallest number m such that m = p(i+1) mod p(i) for 1<=i<=n. A121934 Smallest positive number m such that m == i mod i+1 for all 1<=i<=n.
Sequence in context: A030445 A093990 A156448 this_sequence A055547 A113087 A099729
Adjacent sequences: A157749 A157750 A157751 this_sequence A157753 A157754 A157755
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Zak Seidov (zakseidov(AT)yahoo.com), Mar 05 2009
|
|
EXTENSIONS
|
Edited by Charles R Greathouse IV (charles.greathouse(AT)case.edu), Oct 28 2009
|
|
|
Search completed in 0.002 seconds
|
