A088107 Smallest prime == 1 (mod (least common multiple of next n numbers)).

2, 7, 61, 2521, 120121, 9767521, 248648401, 5083737121, 2679757320241, 1105598948454001, 531670984004161, 343973251893070801, 65801152591041067201, 1102084393565113358401, 710288051968384142853601

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: A089307 A367902 A102896 * A132524 A153694 A354306

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