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.

A062502 Number of prime divisors (with repetition) of the nonprimes (including 1).

Original entry on oeis.org

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

Views

Author

Jason Earls, Jul 09 2001

Keywords

Crossrefs

Programs

  • Maple
    f:= proc(n) if not isprime(n) then numtheory:-bigomega(n) fi end proc:
    map(f, [$1..200]); # Robert Israel, Oct 01 2020
  • Mathematica
    PrimeOmega/@Complement[Range[200],Prime[Range[PrimePi[200]]]]  (* Harvey P. Dale, Apr 22 2011 *)
  • PARI
    je=[]; for(n=1,300, if(isprime(n), n+1,x=bigomega(n); je=concat(je,x))); je

Formula

a(n) = A001222(A018252(n)). - Sean A. Irvine, Mar 31 2023