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.

A269734 a(n) = number of hermit primes (A268343) that are <= prime(n).

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 13, 14, 14, 14, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 17, 17, 17, 18
Offset: 1

Views

Author

N. J. A. Sloane, Mar 09 2016

Keywords

Crossrefs

Cf. A268343.

Programs

  • Maple
    # Assumes that b1 is a list of the terms in A268343
    ans:=[]; ct:=0; M:=120; t1:=1; t2:=b1[t1];
    for i from 1 to M do
    if ithprime(i)