login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A193510
Number of even divisors of Omega(n).
2
0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 2, 0, 0, 0, 0, 1, 1, 0, 2, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 2, 0, 1, 1, 2, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 2, 1, 2, 1, 1, 0, 2, 0, 1, 0, 2, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0
OFFSET
1,16
COMMENTS
Omega(n) is the number of prime divisors of n counted with multiplicity, A001222 (also called bigomega(n)).
Records are at 4^A002182(n). [Charles R Greathouse IV, Jul 29 2011]
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
EXAMPLE
a(16) = 2 because Omega(16) = 4 and the 2 even divisors are {2, 4}.
MATHEMATICA
f[n_] := Block[{d = Divisors[PrimeOmega[n]]}, Count[EvenQ[d], True]]; Table[f[n], {n, 80}]
Join[{0}, Table[Count[Divisors[PrimeOmega[n]], _?EvenQ], {n, 2, 100}]] (* Harvey P. Dale, Jul 05 2023 *)
PROG
(PARI) a(n)=my(k=bigomega(n)); if(!k||k%2, 0, numdiv(k/2)) \\ Charles R Greathouse IV, Jul 29 2011
CROSSREFS
KEYWORD
nonn
AUTHOR
Michel Lagneau, Jul 29 2011
STATUS
approved