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.

Showing 1-1 of 1 results.

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

Original entry on oeis.org

2, 3, 5, 29, 2609, 2269829, 20608503836279, 3397683442959574948323216959, 42930190020276065993287927763424183433168916230440704129, 1192530198055712826264639739575734950954723597893286538562918677849035900498296709057759892487138176511608345909
Offset: 1

Views

Author

Amarnath Murthy, Dec 02 2003

Keywords

Crossrefs

Programs

  • PARI
    terms=12; p=2; print1("2, "); for(n=2, terms, q=p-1; while(!ispseudoprime(q), q=q+p); print1(q, ", "); p=p*q) \\ Serge Batalov, May 22 2015

Extensions

Corrected and extended by David Wasserman, Nov 16 2005
Showing 1-1 of 1 results.