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 A075653 #15 Oct 18 2021 20:47:03
%S A075653 1,4,6,6,10,11,14,10,12,17,22,17,26,23,23,18,34,23,38,27,31,35,46,29,
%T A075653 30,41,30,37,58,40,62,34,47,53,47,41,74,59,55,47,82,54,86,57,53,71,94,
%U A075653 53,56,57,71,67,106,59,71,65,79,89,118,70,122,95,73,66,83,82,134,87,95
%N A075653 a(n) = n + sopf(n), where sopf is the sum of the distinct prime factors of n (A008472).
%C A075653 For 1 <= k <= n, add sigma(k) if k is a prime factor of n, otherwise add 1. For example, a(6) = 11 since for k = 1,2,.. we have 1 + sigma(2) + sigma(3) + 1 + 1 + 1 = 1 + (1+2) + (1+3) + 1 + 1 + 1 = 11. - _Wesley Ivan Hurt_, Oct 18 2021
%H A075653 Harvey P. Dale, <a href="/A075653/b075653.txt">Table of n, a(n) for n = 1..1000</a>
%F A075653 a(n) = n + A008472(n).
%F A075653 a(p) = 2p for primes p. - _Wesley Ivan Hurt_, Oct 18 2021
%e A075653 6 + sum of prime factors of 6 = 6 + 2 + 3 = 11, so a(6) = 11.
%t A075653 Flatten[Append[{1}, Table[n + Apply[Plus, Transpose[FactorInteger[n]][[1]]], {n, 2, 100}]]]
%t A075653 Join[{1},Table[n+Total[FactorInteger[n][[All,1]]],{n,2,70}]] (* _Harvey P. Dale_, Sep 29 2016 *)
%o A075653 (PARI) a(n) = n + vecsum(factor(n)[,1]); \\ _Michel Marcus_, Feb 22 2017
%Y A075653 Cf. A008472, A075254, A075255, A076694.
%K A075653 easy,nonn
%O A075653 1,2
%A A075653 _Joseph L. Pe_, Oct 11 2002