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 A069293 #18 Apr 04 2020 21:25:03
%S A069293 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,5,1,1,1,5,1,1,1,5,1,1,1,5,1,1,1,5,1,1,
%T A069293 1,5,1,1,1,5,1,1,1,5,1,1,1,5,1,1,1,5,1,1,1,5,1,1,1,5,1,1,1,5,1,1,1,5,
%U A069293 1,1,1,5,1,1,1,5,1,1,1,5,10,1,1,5,1,1,1,5,1,10,1,5,1,1,1,5,1,1,10,5,1,1,1,5,1
%N A069293 Sum of square divisors of n <= sqrt(n).
%H A069293 Antti Karttunen, <a href="/A069293/b069293.txt">Table of n, a(n) for n = 1..16384</a>
%H A069293 <a href="/index/Su#sums_of_divisors">Index entries for sequences related to sums of divisors</a>
%F A069293 G.f.: Sum_{k>=1} k^2 * x^(k^4) / (1 - x^(k^2)). - _Ilya Gutkovskiy_, Apr 04 2020
%t A069293 Table[DivisorSum[n, # &, And[IntegerQ@ Sqrt@ #, # <= Sqrt@ n] &], {n, 105}] (* _Michael De Vlieger_, Nov 20 2017 *)
%o A069293 (PARI) A069293(n) = sumdiv(n, d, (issquare(d)&&((d^2)<=n))*d); \\ _Antti Karttunen_, Nov 20 2017
%Y A069293 Cf. A000188, A035316, A046951, A069290, A069291, A069292.
%K A069293 nonn
%O A069293 1,16
%A A069293 _Reinhard Zumkeller_, Mar 14 2002
%E A069293 More terms from _Antti Karttunen_, Nov 20 2017