The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
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
Rafael Jakimczuk and Matilde Lalín, The Number of Prime Factors on Average in Certain Integer Sequences, Journal of Integer Sequences, Vol. 25 (2022), Article 22.2.3.
FORMULA
a(n) = A001222(A004709(n)).
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
Sequence in context: A118459 A274354 A083870 * A052299 A071854 A183025
KEYWORD
nonn,easy
AUTHOR
Amiram Eldar, Jan 05 2024
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 May 15 04:25 EDT 2024. Contains 372536 sequences. (Running on oeis4.)