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.

A101787 a(n) = |S(n)| where S(n) = {i : 1 <= i <= n and 4*i-1 and 8*i-1 are primes}.

Original entry on oeis.org

1, 1, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10
Offset: 1

Views

Author

Douglas Stones (dssto1(AT)student.monash.edu.au), Dec 16 2004

Keywords

Comments

Number of Lucasian primes that do not exceed 4*n-1. [Corrected by Amiram Eldar, May 23 2024]

Crossrefs

Programs

  • Mathematica
    Accumulate[Table[Boole[And @@ PrimeQ[{4, 8}*i - 1]], {i, 1, 100}]] (* Amiram Eldar, May 23 2024 *)

Extensions

Name corrected by Amiram Eldar, May 23 2024