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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A159293 a(n) = smallest prime congruent to 1 mod A051426(n). 0
3, 5, 13, 73, 241, 241, 2521, 3361, 15121, 15121, 55441, 55441, 4324321, 4324321, 4324321, 4324321, 196035841, 196035841, 1862340481, 1862340481, 1862340481, 1862340481, 10708457761, 10708457761, 214169155201, 214169155201 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

MATHEMATICA

L1=2; A1={3}; Do[L1=LCM[L1, n]; k=1; While[ !PrimeQ[p=k*L1+1], k++ ]; Print[p]; AppendTo[A1, n], {n, 4, 60, 2}]

CROSSREFS

A051426 Least common multiple of {2, 4, 6..., 2n}.

Sequence in context: A153207 A144718 A066141 * A051901 A018928 A180313

Adjacent sequences:  A159290 A159291 A159292 * A159294 A159295 A159296

KEYWORD

nonn

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), Apr 09 2009

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 18:26 EST 2012. Contains 206065 sequences.