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).

This page as a plain text file.
%I A062502 #16 Mar 31 2023 21:40:36
%S A062502 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,
%T A062502 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,
%U A062502 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
%N A062502 Number of prime divisors (with repetition) of the nonprimes (including 1).
%H A062502 Robert Israel, <a href="/A062502/b062502.txt">Table of n, a(n) for n = 1..10000</a>
%F A062502 a(n) = A001222(A018252(n)). - _Sean A. Irvine_, Mar 31 2023
%p A062502 f:= proc(n) if not isprime(n) then numtheory:-bigomega(n) fi end proc:
%p A062502 map(f, [$1..200]); # _Robert Israel_, Oct 01 2020
%t A062502 PrimeOmega/@Complement[Range[200],Prime[Range[PrimePi[200]]]]  (* _Harvey P. Dale_, Apr 22 2011 *)
%o A062502 (PARI) je=[]; for(n=1,300, if(isprime(n), n+1,x=bigomega(n); je=concat(je,x))); je
%Y A062502 Cf. A001222, A018252.
%K A062502 nonn
%O A062502 1,2
%A A062502 _Jason Earls_, Jul 09 2001