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 A069291 #16 Apr 04 2020 21:24:55
%S A069291 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,2,1,1,1,2,1,1,1,2,1,1,1,2,1,1,
%T A069291 1,2,1,1,1,2,1,1,1,2,1,1,1,2,1,1,1,2,1,1,1,2,1,1,1,2,1,1,1,2,1,1,1,2,
%U A069291 1,1,1,2,1,1,1,2,1,1,1,2,2,1,1,2,1,1,1,2,1,2,1,2,1,1,1,2,1,1,2,2,1,1,1,2,1,1,1,3,1,1,1,2,1,1,1,2,2,1,1,2
%N A069291 Number of square divisors of n <= sqrt(n).
%C A069291 Terms 1, 2, 3, ... occurs for the first time at 1, 16, 108, 288, 1296, 3600, 10368, 14400, ... - _Antti Karttunen_, Nov 20 2017
%H A069291 Antti Karttunen, <a href="/A069291/b069291.txt">Table of n, a(n) for n = 1..16384</a>
%F A069291 G.f.: Sum_{k>=1} x^(k^4) / (1 - x^(k^2)). - _Ilya Gutkovskiy_, Apr 04 2020
%t A069291 Table[DivisorSum[n, 1 &, And[IntegerQ@ Sqrt@ #, # <= Sqrt@ n] &], {n, 120}] (* _Michael De Vlieger_, Nov 20 2017 *)
%o A069291 (PARI) A069291(n) = sumdiv(n, d, (issquare(d)&&((d^2)<=n))); \\ _Antti Karttunen_, Nov 20 2017
%Y A069291 Cf. A000188, A035316, A046951, A069290, A069292, A069293.
%K A069291 nonn
%O A069291 1,16
%A A069291 _Reinhard Zumkeller_, Mar 14 2002
%E A069291 More terms from _Antti Karttunen_, Nov 20 2017