Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A159293
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A159293 a(n) = smallest prime congruent to 1 mod A051426(n). +0
1
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; listen)
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 this_sequence A051901 A018928 A053630

Adjacent sequences: A159290 A159291 A159292 this_sequence A159294 A159295 A159296

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research