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.

A023568 Number of distinct prime divisors of prime(n)-3.

Original entry on oeis.org

0, 0, 1, 1, 1, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 1, 2, 2, 2, 2, 3, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 3, 2, 2, 2, 3, 3, 2, 3, 3, 2, 2, 2, 2, 2, 3, 2, 3, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 3, 3, 3
Offset: 1

Views

Author

Keywords

Comments

a(n) = 1 if prime(n) is in A057733. - Robert Israel, Dec 28 2015

Crossrefs

Programs

  • Maple
    0,0,seq(nops(numtheory:-factorset(ithprime(i)-3)), i=3..100); # Robert Israel, Dec 28 2015
  • Mathematica
    Join[{0,0},PrimeNu/@(Prime[Range[3,100]]-3)] (* Harvey P. Dale, Sep 09 2017 *)