login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088107 Smallest prime == 1 (mod (least common multiple of next n numbers)). 1
2, 7, 61, 2521, 120121, 9767521, 248648401, 5083737121, 2679757320241, 1105598948454001, 531670984004161, 343973251893070801, 65801152591041067201, 1102084393565113358401, 710288051968384142853601 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Harvey P. Dale, Table of n, a(n) for n = 1..200

EXAMPLE

a(3) = 61; 61 == 1 (mod 60), 60 = lcm(4,5,6).

MATHEMATICA

getp[n_]:=Module[{p=n+1}, While[!PrimeQ[p], p=p+n]; p]; getp/@With[{rr=15}, LCM@@#&/@TakeList[Range[(rr(rr+1))/2], Range[rr]]] (* Requires Mathematica version 11 or later *) (* Harvey P. Dale, Dec 19 2017 *)

CROSSREFS

Cf. A088106.

Sequence in context: A111010 A089307 A102896 * A132524 A153694 A228906

Adjacent sequences:  A088104 A088105 A088106 * A088108 A088109 A088110

KEYWORD

nonn

AUTHOR

Amarnath Murthy, Sep 24 2003

EXTENSIONS

More terms from David Wasserman, Jul 19 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 21 05:39 EST 2020. Contains 331104 sequences. (Running on oeis4.)