|
Search: id:A090474
|
|
|
| A090474 |
|
Beginning with 2, a(n+1) is the least prime == 1 (mod (Sum a(i), i=1 to n)). |
|
+0
3
|
|
| 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; listen)
|
|
|
OFFSET
|
1,1
|
|
|
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}] (Propper)
|
|
CROSSREFS
|
Sequence in context: A051096 A051090 A061400 this_sequence A024861 A025101 A025105
Adjacent sequences: A090471 A090472 A090473 this_sequence A090475 A090476 A090477
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Dec 02 2003
|
|
EXTENSIONS
|
More terms from Ryan Propper (rpropper(AT)stanford.edu), Jul 29 2005
Further terms from David Wasserman (wasserma(AT)spawar.navy.mil), Nov 16 2005
|
|
|
Search completed in 0.002 seconds
|
