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.

A185231 a(n) = largest prime <= 2a(n-1), with a(0)=1.

Original entry on oeis.org

1, 2, 3, 5, 7, 13, 23, 43, 83, 163, 317, 631, 1259, 2503, 5003, 9973, 19937, 39869, 79699, 159389, 318751, 637499, 1274989, 2549951, 5099893, 10199767, 20399531, 40799041, 81598067, 163196129, 326392249, 652784471, 1305568919, 2611137817
Offset: 0

Views

Author

N. J. A. Sloane, Jan 24 2012, following a suggestion from Frank M Jackson

Keywords

Comments

Equals 1 followed by A006992.
This is a complete sequence (cf. A075058).

Crossrefs

Programs

  • Mathematica
    np[n_]:=Module[{p=NextPrime[2n]},If[p<=2n,p,NextPrime[p,-1]]]; NestList[ np,1,40] (* Harvey P. Dale, Sep 29 2019 *)
  • PARI
    lista(nn) = {p = 1; for (n = 1, nn, print1(p, ", "); p = precprime(2*p););} \\ Michel Marcus, Aug 26 2013