A382965 The number of non-unitary prime divisors of the n-th cubefree number that is not squarefree.
1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
Offset: 1
Links
- Amiram Eldar, Table of n, a(n) for n = 1..10000
Programs
-
Mathematica
f[k_] := If[k == 1, Nothing, Module[{e = FactorInteger[k][[;; , 2]]}, If[Max[e] == 2, Count[e, 2], Nothing]]]; Array[f, 150]
-
PARI
list(lim) = {my(e); for(k = 2, lim, e = factor(k)[, 2]; if(vecmax(e) == 2, print1(#select(x -> x == 2, e), ", ")));}
Comments