|
|
A193509
|
|
Number of odd divisors of Omega(n).
|
|
4
|
|
|
0, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 2, 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 2, 2, 1, 2, 1, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,8
|
|
COMMENTS
|
Omega(n) is the number of prime divisors of n counted with multiplicity, A001222 (also called bigomega(n)).
|
|
LINKS
|
|
|
EXAMPLE
|
a(8) = 2 because Omega(8) = 3 and the 2 odd divisors are {1, 3}.
|
|
MATHEMATICA
|
f[n_] := Block[{d = Divisors[PrimeOmega[n]]}, Count[OddQ[d], True]]; Table[f[n], {n, 80}]
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|