cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A090474 Beginning with 2, a(n+1) is the least prime == 1 (mod (Sum_{i=1..n} a(i))).

Original entry on oeis.org

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
Offset: 1

Views

Author

Amarnath Murthy, Dec 02 2003

Keywords

Programs

  • 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 *)

Extensions

More terms from Ryan Propper, Jul 29 2005
Further terms from David Wasserman, Nov 16 2005