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.

A322669 a(n) is the least prime(k+n-1) satisfying k > 0 and prime(k+n-1) < prime(k) + prime(k+1).

Original entry on oeis.org

7, 17, 23, 41, 47, 59, 67, 73, 83, 103, 107, 109, 137, 151, 167, 179, 181, 193, 197, 233, 239, 251, 257, 271, 281, 283, 313, 317, 349, 359, 379, 383, 409, 421, 431, 433, 443, 449, 467, 491, 503, 523, 571, 587, 593, 599, 607, 613, 617, 643, 647, 659, 661, 677, 683, 733, 739
Offset: 3

Views

Author

Seiichi Manyama, Dec 23 2018

Keywords

Crossrefs

Cf. A322668.

Programs

  • Mathematica
    Array[Block[{k = 1, p}, While[Set[p, Prime[k + # - 1]] >= Total@ Prime@ {k, k + 1}, k++]; p] &, 57, 3] (* Michael De Vlieger, Jan 01 2019 *)
  • PARI
    a(n) = {my(p=2, k=1); while(!(prime(k+n-1) < p+nextprime(p+1)), p = nextprime(p+1); k++); prime(k+n-1);} \\ Michel Marcus, Dec 23 2018
Showing 1-1 of 1 results.