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.

A023575 Number of distinct prime divisors of prime(n)+3.

Original entry on oeis.org

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

Views

Author

Keywords

Crossrefs

Cf. A000040 (prime), A001221 (omega).

Programs

  • Maple
    f:= proc(p) nops(numtheory:-factorset(p+3)) end proc:
    map(f, [seq(ithprime(i),i=1..100)]); # Robert Israel, Mar 06 2022
  • Mathematica
    a[n_] := PrimeNu[Prime[n]+3]; Array[a, 100] (* Amiram Eldar, Sep 29 2024 *)
  • PARI
    a(n) = omega(prime(n)+3); \\ Amiram Eldar, Sep 29 2024

Formula

a(n) = omega(prime(n)+3). - Wesley Ivan Hurt, Mar 06 2022