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!)
A363895 Floor of the average of the distinct prime factors of n. 4
2, 3, 2, 5, 2, 7, 2, 3, 3, 11, 2, 13, 4, 4, 2, 17, 2, 19, 3, 5, 6, 23, 2, 5, 7, 3, 4, 29, 3, 31, 2, 7, 9, 6, 2, 37, 10, 8, 3, 41, 4, 43, 6, 4, 12, 47, 2, 7, 3, 10, 7, 53, 2, 8, 4, 11, 15, 59, 3, 61, 16, 5, 2, 9, 5, 67, 9, 13, 4, 71, 2, 73, 19, 4, 10, 9, 6, 79 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,1
LINKS
FORMULA
a(p^n) = p, p prime, n >= 1.
a(n) = floor(A008472(n)/A001221(n)).
a(n) = floor(A323171(n)/A323172(n)).
MATHEMATICA
a[n_] := Floor[Mean[FactorInteger[n][[;; , 1]]]]; Array[a, 100, 2] (* Amiram Eldar, Jun 27 2023 *)
PROG
(Python)
from sympy import factorint
def a(n):
P = factorint(n).keys()
return int(sum(P)/len(P))
print([a(n) for n in range(2, 85)])
(PARI) a(n) = my(p = factor(n)[, 1]); vecsum(p)\#p; \\ Amiram Eldar, Jun 29 2023
CROSSREFS
Sequence in context: A273288 A080210 A126594 * A086765 A079868 A280697
KEYWORD
easy,nonn
AUTHOR
Darío Clavijo, Jun 26 2023
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 June 8 05:45 EDT 2024. Contains 373207 sequences. (Running on oeis4.)