login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
a(n) = A086971(n) - A106404(n);
a(A046315(n)) = 1; a(A093641(n)) = 0; a(A105441(n)) > 0.
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
Sequence in context: A236389 A337821 A143078 * A228601 A363856 A369354
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, May 02 2005
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 11:06 EDT 2024. Contains 371967 sequences. (Running on oeis4.)