Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #6 Nov 17 2024 07:09:22
%S 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 31,215,40,554,30,490,32,63,178,347,122,301,38,425,234,1281,42,902,44,
%U 1786,330,605,48,966,57,250,370,2810,54,301,218,3909,450,935,60,2751
%N a(n) = sum of row n of A376248.
%C For prime p, a(p) = A244974(p) = A000203(p) = p+1.
%C For prime power p^k, a(p^k) = A244974(p^k) = A000203(p^k).
%C For n in A024619, a(n) != A244974(n).
%H Michael De Vlieger, <a href="/A377378/b377378.txt">Table of n, a(n) for n = 1..10000</a>
%t rad[x_] := rad[x] = Times @@ FactorInteger[x][[All, 1]];
%t Block[{k}, Table[k = PrimeOmega[n];
%t Total@ Select[Range[n^PrimeNu[n]],
%t Divisible[n, rad[#]] && PrimeOmega[#] <= k &], {n, 60}]]
%Y Cf. A000203, A024619, A244974, A376248.
%K nonn,easy
%O 1,2
%A _Michael De Vlieger_, Nov 14 2024