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