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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

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

Table of n, a(n) for n=1..25.

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

Adjacent sequences:  A090471 A090472 A090473 * A090475 A090476 A090477

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 5 12:51 EST 2020. Contains 338947 sequences. (Running on oeis4.)