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 A377378 #6 Nov 17 2024 07:09:22 %S A377378 1,3,4,7,6,25,8,15,13,47,12,90,14,77,58,31,18,90,20,250,90,161,24,301, %T A377378 31,215,40,554,30,490,32,63,178,347,122,301,38,425,234,1281,42,902,44, %U A377378 1786,330,605,48,966,57,250,370,2810,54,301,218,3909,450,935,60,2751 %N A377378 a(n) = sum of row n of A376248. %C A377378 For prime p, a(p) = A244974(p) = A000203(p) = p+1. %C A377378 For prime power p^k, a(p^k) = A244974(p^k) = A000203(p^k). %C A377378 For n in A024619, a(n) != A244974(n). %H A377378 Michael De Vlieger, <a href="/A377378/b377378.txt">Table of n, a(n) for n = 1..10000</a> %t A377378 rad[x_] := rad[x] = Times @@ FactorInteger[x][[All, 1]]; %t A377378 Block[{k}, Table[k = PrimeOmega[n]; %t A377378 Total@ Select[Range[n^PrimeNu[n]], %t A377378 Divisible[n, rad[#]] && PrimeOmega[#] <= k &], {n, 60}]] %Y A377378 Cf. A000203, A024619, A244974, A376248. %K A377378 nonn,easy %O A377378 1,2 %A A377378 _Michael De Vlieger_, Nov 14 2024