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 A097974 #31 Apr 04 2020 21:25:12
%S A097974 0,0,0,2,0,2,0,2,3,2,0,5,0,2,3,2,0,5,0,2,3,2,0,5,5,2,3,2,0,10,0,2,3,2,
%T A097974 5,5,0,2,3,7,0,5,0,2,8,2,0,5,7,7,3,2,0,5,5,9,3,2,0,10,0,2,10,2,5,5,0,
%U A097974 2,3,14,0,5,0,2,8,2,7,5,0,7,3,2,0,12,5,2,3,2,0,10,7,2,3,2,5,5,0,9,3,7,0,5,0
%N A097974 Sum of distinct prime divisors of n which are <= sqrt(n).
%H A097974 Reinhard Zumkeller, <a href="/A097974/b097974.txt">Table of n, a(n) for n = 1..10000</a>
%F A097974 G.f.: Sum_{k>=1} prime(k) * x^(prime(k)^2) / (1 - x^prime(k)). - _Ilya Gutkovskiy_, Apr 04 2020
%e A097974 2 and 3 are the distinct prime divisors of 12 and both 2 and 3 are <= square root of 12. So a(12) = 2 + 3 = 5.
%p A097974 with(numtheory): a:=proc(n) local s,F,f,i: s:=0: F:=factorset(n): f:=nops(F): for i from 1 to f do if F[i]^2<=n then s:=s+F[i] else s:=s: fi od: s; end: seq(a(n),n=1..110); # _Emeric Deutsch_, Jan 30 2006
%t A097974 Do[Print[Plus @@ Select[Select[Divisors[n], PrimeQ], #<=Sqrt[n] &]], {n, 1, 100}] (* _Ryan Propper_, Jul 23 2005 *)
%t A097974 Table[DivisorSum[n, # &, And[PrimeQ@ #, # <= Sqrt[n]] &], {n, 103}] (* _Michael De Vlieger_, Sep 04 2017 *)
%o A097974 (Haskell)
%o A097974 a097974 n = sum [p | p <- a027748_row n, p ^ 2 <= n]
%o A097974 -- _Reinhard Zumkeller_, Apr 05 2012
%o A097974 (PARI) a(n) = sumdiv(n, d, d*isprime(d)*(d <= sqrt(n))); \\ _Michel Marcus_, Aug 17 2017
%Y A097974 Cf. A027748, A063962.
%K A097974 nonn
%O A097974 1,4
%A A097974 _Leroy Quet_, Sep 07 2004
%E A097974 More terms from _Ryan Propper_, Jul 23 2005
%E A097974 Further terms from _Emeric Deutsch_, Jan 30 2006