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.

A058000 a(n) is smallest prime such that a(n)+1 is a proper multiple of a(n-1)+1 [with a(1)=1].

Original entry on oeis.org

1, 3, 7, 23, 47, 191, 383, 1151, 6911, 27647, 138239, 691199, 3455999, 34559999, 138239999, 414719999, 2073599999, 16588799999, 364953599999, 4744396799999, 66421555199999, 132843110399999, 664215551999999, 3321077759999999
Offset: 1

Views

Author

Henry Bottomley, Nov 02 2000

Keywords

Crossrefs

Formula

a(n)= Product{i=1_n}[A036013(i)]-1 = a(n-1)*A036013(n)-1+A036013(n).