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 A349555 #8 Nov 23 2021 11:18:59
%S A349555 0,1,3,4,6,7,11,16,15,12,18,25,29,34,35,40,42,55,59,72,69,66,78,97,96,
%T A349555 87,98,93,101,122,130,159,148,143,150,157,161,178,183,192,198,229,239,
%U A349555 270,275,258,282,325,322,323,310,315,329,378,367,374,361,352,382,433,441,470
%N A349555 a(n) = Sum_{p<=n, p prime} p^floor(1/gcd(n/p)).
%C A349555 For each prime number p less than or equal to n, add 1 if p|n, otherwise add p (see example).
%F A349555 a(n) = A001221(n) + A066911(n).
%e A349555 a(9) = 15; The primes less than or equal to 9 are 2, 3, 5, 7 and only 3|9. We then have, respectively, a(9) = 2 + 1 + 5 + 7 = 15.
%t A349555 nterms=100;Table[Total[Map[If[Mod[n,#]==0,1,#]&,Prime[Range[PrimePi[n]]]]],{n,nterms}] (* _Paolo Xausa_, Nov 22 2021 *)
%Y A349555 Cf. A001221, A066911.
%K A349555 nonn
%O A349555 1,3
%A A349555 _Wesley Ivan Hurt_, Nov 21 2021