|
|
A368779
|
|
The number of prime factors of the cubefree numbers, counted with multiplicity.
|
|
1
|
|
|
0, 1, 1, 2, 1, 2, 1, 2, 2, 1, 3, 1, 2, 2, 1, 3, 1, 3, 2, 2, 1, 2, 2, 3, 1, 3, 1, 2, 2, 2, 4, 1, 2, 2, 1, 3, 1, 3, 3, 2, 1, 2, 3, 2, 3, 1, 2, 2, 2, 1, 4, 1, 2, 3, 2, 3, 1, 3, 2, 3, 1, 1, 2, 3, 3, 2, 3, 1, 2, 1, 4, 2, 2, 2, 1, 4, 2, 3, 2, 2, 2, 1, 3, 3, 4, 1, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
LINKS
|
|
|
FORMULA
|
Sum_{a(n) <= x} = (1/zeta(3)) * x * log(log(x)) + O(x) (Jakimczuk and Lalín, 2022).
|
|
MATHEMATICA
|
f[n_] := Module[{e = FactorInteger[n][[;; , 2]]}, If[AllTrue[e, # < 3 &], Total[e], Nothing]]; f[1] = 0; Array[f, 100]
|
|
PROG
|
(PARI) lista(max) = {my(e); for(k = 1, max, e = factor(k)[, 2]; if(k == 1 || vecmax(e) < 3, print1(vecsum(e), ", "))); }
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|