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.

A062839 a(n) = floor((prime(n-1)+prime(n+1))/2).

Original entry on oeis.org

1, 3, 5, 8, 10, 14, 16, 20, 24, 27, 33, 36, 40, 44, 48, 53, 57, 63, 66, 70, 75, 78, 84, 90, 95, 100, 104, 106, 110, 118, 122, 132, 135, 143, 145, 153, 157, 162, 168, 173, 177, 185, 187, 194, 196, 204, 211, 219, 226, 230, 234, 237, 245, 249, 257, 263, 267, 273
Offset: 1

Views

Author

Jason Earls, Jul 21 2001

Keywords

Crossrefs

Programs

  • PARI
    j=[]; for(n=1,200,j=concat(j,floor((prime(n-1)+prime(n+1))/2))); j

Formula

a(n) = A024675(n-1) - A028334(n-1), n>2. - R. J. Mathar, Apr 16 2008