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.

A023581 Sum of exponents in prime-power factorization of p(n)+3.

Original entry on oeis.org

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

Views

Author

Keywords

Programs

  • Magma
    [n eq 1 select 1 else (&+[p[2]: p in Factorization(NthPrime(n) + 3)]): n in [1..100]]; // G. C. Greubel, May 21 2019
    
  • Mathematica
    Table[PrimeOmega[3 + Prime[n]], {n, 1, 100}] (* G. C. Greubel, May 21 2019 *)
  • PARI
    a(n) = bigomega(prime(n) + 3); \\ Michel Marcus, Sep 30 2013
    
  • Sage
    [sloane.A001222(nth_prime(n)+3) for n in (1..100)] # G. C. Greubel, May 21 2019

Formula

a(n) = A001222(A113935(n)). - Michel Marcus, Sep 30 2013