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.

A364411 a(n) = prime(n) + 2*prime(n+1).

Original entry on oeis.org

8, 13, 19, 29, 37, 47, 55, 65, 81, 91, 105, 119, 127, 137, 153, 171, 181, 195, 209, 217, 231, 245, 261, 283, 299, 307, 317, 325, 335, 367, 389, 405, 415, 437, 451, 465, 483, 497, 513, 531, 541, 563, 577, 587, 595, 621, 657, 677, 685, 695, 711, 721, 743, 765, 783
Offset: 1

Views

Author

Paul Curtz, Jul 23 2023

Keywords

Comments

All terms > 8 are odd.

Crossrefs

Cf. A000040, A001043, A062234, A094105, A100484, A191472 (first differences), A210497.

Programs

  • Mathematica
    ListConvolve[{2,1},Prime[Range[100]]] (* Paolo Xausa, Nov 02 2023 *)

Formula

a(n) = a(n-1) + A191472(n-1).
a(n) = A000040(n) + A100484(n+1).
a(n) = A000040(n+1) + A001043(n).