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 A333808 #4 Apr 05 2020 23:28:11
%S A333808 0,0,0,0,0,2,0,2,0,2,0,5,0,2,3,2,0,5,0,2,3,2,0,5,0,2,3,2,0,10,0,2,3,2,
%T A333808 5,5,0,2,3,7,0,5,0,2,8,2,0,5,0,7,3,2,0,5,5,9,3,2,0,10,0,2,10,2,5,5,0,
%U A333808 2,3,14,0,5,0,2,8,2,7,5,0,7,3,2,0,12,5,2,3,2,0,10
%N A333808 Sum of distinct prime divisors of n that are < sqrt(n).
%F A333808 G.f.: Sum_{k>=1} prime(k) * x^(prime(k)*(prime(k) + 1)) / (1 - x^prime(k)).
%t A333808 Table[DivisorSum[n, # &, # < Sqrt[n] && PrimeQ[#] &], {n, 1, 90}]
%t A333808 nmax = 90; CoefficientList[Series[Sum[Prime[k] x^(Prime[k] (Prime[k] + 1))/(1 - x^Prime[k]), {k, 1, nmax}], {x, 0, nmax}], x] // Rest
%Y A333808 Cf. A008472, A070039, A097974, A333806, A333807.
%K A333808 nonn
%O A333808 1,6
%A A333808 _Ilya Gutkovskiy_, Apr 05 2020