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.

A088427 Number of primes in arithmetic progression starting with 23 and with d=2n.

Original entry on oeis.org

1, 1, 2, 2, 1, 1, 2, 1, 3, 2, 1, 3, 1, 1, 4, 1, 1, 2, 2, 1, 1, 2, 1, 2, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 4, 2, 1, 3, 2, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 4, 1, 1, 3, 2, 1, 1, 1, 1, 2, 2, 1, 1, 2, 1, 1, 2, 1, 3, 1, 1, 2, 1, 1, 2, 2, 1, 1, 1, 1, 3, 2, 1, 2, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2
Offset: 1

Views

Author

Zak Seidov, Sep 29 2003

Keywords

Comments

Arithmetic progression is stopped when next term is not prime. E.g. for n=15 (d=30), a=3, that is 23,53,83,113 are prime, while next term, 143, is not prime.

Crossrefs

Programs

  • Mathematica
    bb={}; Do[s=1; Do[If[PrimeQ[23+k*d], s=s+1, bb={bb, s}; Break[]], {k, 10}], {d, 2, 200, 2}]; Flatten[bb]