This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A363895 #48 Jul 01 2023 09:31:27 %S A363895 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, %T A363895 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, %U A363895 61,16,5,2,9,5,67,9,13,4,71,2,73,19,4,10,9,6,79 %N A363895 Floor of the average of the distinct prime factors of n. %F A363895 a(p^n) = p, p prime, n >= 1. %F A363895 a(n) = floor(A008472(n)/A001221(n)). %F A363895 a(n) = floor(A323171(n)/A323172(n)). %t A363895 a[n_] := Floor[Mean[FactorInteger[n][[;; , 1]]]]; Array[a, 100, 2] (* _Amiram Eldar_, Jun 27 2023 *) %o A363895 (Python) %o A363895 from sympy import factorint %o A363895 def a(n): %o A363895 P = factorint(n).keys() %o A363895 return int(sum(P)/len(P)) %o A363895 print([a(n) for n in range(2, 85)]) %o A363895 (PARI) a(n) = my(p = factor(n)[, 1]); vecsum(p)\#p; \\ _Amiram Eldar_, Jun 29 2023 %Y A363895 Cf. A126594, A008472, A001221, A078174, A323171, A323172. %K A363895 easy,nonn %O A363895 2,1 %A A363895 _Darío Clavijo_, Jun 26 2023