|
|
A106405
|
|
Number of odd semiprimes dividing n.
|
|
3
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 2, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 2, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 2, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 2, 1, 0, 1, 0, 1, 0, 0, 1, 2, 1, 0, 1, 0, 0, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,45
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(105) = #{15, 21, 35} = #{3*5, 3*7, 5*7} = 3.
|
|
MATHEMATICA
|
Table[Count[Divisors[n], _?(OddQ[#]&&PrimeOmega[#]==2&)], {n, 120}] (* Harvey P. Dale, May 05 2015 *)
a[n_] := Count[e = FactorInteger[n][[;; , 2]], _?(# > 1 &)] + (o = Length[e])*(o - 1)/2 - If[EvenQ[n], If[e[[1]] > 1, o, o - 1], 0]; Array[a, 100] (* Amiram Eldar, Jun 30 2022 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|