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 A369867 #13 May 11 2024 21:22:24
%S A369867 0,2,2,6,2,21,2,28,15,61,2,106,2,125,70,152,2,285,2,318,134,347,2,596,
%T A369867 55,539,207,630,2,1073,2,848,356,1009,174,1542,2,1279,548,1572,2,2213,
%U A369867 2,1766,912,1915,2,2984,119,2715,1018,2654,2,3879,396,3148,1288,3167
%N A369867 a(n) = n * Sum_{p|n, p prime} prime(n/p) / p.
%F A369867 From _Wesley Ivan Hurt_, May 10 2024: (Start)
%F A369867 a(p^k) = p^(k-1) * prime(p^(k-1)) for primes p and k >= 1.
%F A369867 a(A246655(n)) = A033286(A003557(A246655(n))). (End)
%t A369867 Table[n*DivisorSum[n, Prime[n/#]/# &, PrimeQ[#] &], {n, 60}]
%o A369867 (PARI) a(n) = my(vp=primes([1, n])); n*sum(i=1, #vp, if (!(n % vp[i]), prime(n/vp[i])/vp[i])); \\ _Michel Marcus_, May 11 2024
%Y A369867 Cf. A000040, A351368, A369748, A369749, A369750, A369866.
%Y A369867 Cf. A003557, A033286, A246655.
%K A369867 nonn,easy
%O A369867 1,2
%A A369867 _Wesley Ivan Hurt_, Feb 03 2024