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 A364389 #5 Jul 23 2023 13:42:22
%S A364389 0,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,
%T A364389 0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,1,0,1,0,1,0,2,0,1,0,1,0,1,1,1,0,1,0,1,
%U A364389 0,2,0,1,0,1,0,1,1,1,0,1,0,1,0,2,0,1,0,1,0,1,1,1,0,1,0,1,0,2,0,1
%N A364389 Number of divisors of n of the form 5*k+2 that are at most sqrt(n).
%F A364389 G.f.: Sum_{k>=0} x^(5*k+2)^2 / (1 - x^(5*k+2)).
%t A364389 Table[Count[Divisors[n], _?(# <= Sqrt[n] && MemberQ[{2}, Mod[#, 5]] &)], {n, 100}]
%t A364389 nmax = 100; CoefficientList[Series[Sum[x^(5 k + 2)^2/(1 - x^(5 k + 2)), {k, 0, nmax}], {x, 0, nmax}], x] // Rest
%Y A364389 Cf. A001877, A038548, A364388.
%K A364389 nonn
%O A364389 1,56
%A A364389 _Ilya Gutkovskiy_, Jul 21 2023