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 A095118 #23 Dec 15 2017 04:11:18
%S A095118 1,1,1,5,1,5,1,5,10,5,1,14,1,5,10,21,1,14,1,21,10,5,1,30,26,5,10,21,1,
%T A095118 39,1,21,10,5,26,66,1,5,10,46,1,50,1,21,35,5,1,66,50,30,10,21,1,50,26,
%U A095118 70,10,5,1,91,1,5,59,85,26,50,1,21,10,79,1,130,1,5,35,21,50,50,1,110,91
%N A095118 a(n) is the sum of the squares of the divisors of n which are <= sqrt(n).
%H A095118 Michael De Vlieger, <a href="/A095118/b095118.txt">Table of n, a(n) for n = 1..10000</a>
%F A095118 G.f.: Sum_{n>=1} n^2*x^(n^2)/(1-x^n). - _Joerg Arndt_, Jan 30 2011
%e A095118 The divisors of 12 which are <= sqrt(12) are 1,2,3, so a(12) = 1^2 + 2^2 + 3^2 = 14.
%t A095118 a[n_]:=Plus@@(Select[Divisors[n], #^2<=n&]^2)
%t A095118 (* Second program: *)
%t A095118 Table[DivisorSum[n, #^2 &, # <= Sqrt@ n &], {n, 81}] (* _Michael De Vlieger_, Dec 14 2017 *)
%o A095118 (PARI) N=100; x='x+O('x^N); Vec( sum(n=1, N, n^2*x^(n^2)/(1-x^n) ) ) \\ _Joerg Arndt_, Jan 02 2017
%o A095118 (PARI) a(n) = my(rn = sqrt(n)); sumdiv(n, d, d^2*(d<=rn)); \\ _Michel Marcus_, Jan 02 2017
%Y A095118 Cf. A095119, A066839.
%K A095118 nonn
%O A095118 1,4
%A A095118 _Dean Hickerson_, following a suggestion of _Leroy Quet_, May 28 2004