login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A071057 Smallest number m such that m = p(i+1) mod p(i) for 1<=i<=n. 1
1, 5, 17, 137, 1817, 20297, 350627, 8518787, 86116307, 5886530927, 193507634597, 6210322338497, 124942132495457, 3471695031294767, 42719979026304857, 3117168891968761907, 850435289298909924887, 91220171746546903961177 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

MATHEMATICA

Table[ ChineseRemainder[ Table[ Prime[i + 1], {i, 1, n}], Table[ Prime[i], {i, 1, n}]], {n, 1, 20}]

CROSSREFS

Cf. A053664.

Sequence in context: A076448 A096310 A176133 * A177509 A160611 A119769

Adjacent sequences:  A071054 A071055 A071056 * A071058 A071059 A071060

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), May 25 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 00:09 EST 2012. Contains 205978 sequences.