A106799 Number of prime factors of n apart from 2 or 3, counted with multiplicity.
0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 2, 1, 0, 1, 1, 1, 1, 0, 1, 1, 2, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 2, 2, 1, 1, 1, 0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 0, 2, 1, 1, 1, 1, 2, 1, 0, 1, 1, 2, 1, 2, 1, 1, 1, 0, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 0, 1, 2, 1, 2, 1, 1, 1, 1, 2
Offset: 1
Keywords
Examples
a(24) = 0 since 24 = 2*2*2*3. a(25) = 2 since 25 = 5*5. a(26) = 1 since 26 = 2*13.
Links
- Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Programs
-
Haskell
a106799 = a001222 . a065330 -- Reinhard Zumkeller, Nov 19 2015
-
Mathematica
a[n_] := PrimeOmega[n] - IntegerExponent[n, 2] - IntegerExponent[n, 3]; Array[a, 100] (* Amiram Eldar, Jan 16 2022 *)
-
PARI
a(n) = bigomega(n) - valuation(n, 2) - valuation(n, 3); \\ Michel Marcus, Jan 16 2022
Comments