login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A090474 Beginning with 2, a(n+1) is the least prime == 1 (mod (Sum_{i=1..n} a(i))). 2
2, 3, 11, 17, 67, 101, 1609, 1811, 7243, 43457, 108643, 488893, 5214857, 23466857, 938674273, 3872031377, 29040235327, 542084392769, 65659972074139, 3179324963589889, 58420096205964211, 1849969713188866681, 76465414811806489481, 1881049204370439641233, 94052460218521982061649 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
MATHEMATICA
s = t = 2; Print[t]; Do[k = 1; While[ !PrimeQ[k*t + 1], k++ ]; p = k*t + 1; Print[p]; t += p, {n, 2, 30}] (* Ryan Propper, Jul 29 2005 *)
CROSSREFS
Sequence in context: A051090 A263933 A061400 * A263934 A263935 A263936
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Dec 02 2003
EXTENSIONS
More terms from Ryan Propper, Jul 29 2005
Further terms from David Wasserman, Nov 16 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 15:03 EDT 2024. Contains 371794 sequences. (Running on oeis4.)