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 A175462 #15 Jan 14 2024 02:25:21
%S A175462 2,2,4,2,2,6,2,2,4,4,4,4,2,2,6,4,4,4,2,2,8,2,2,8,2,4,4,4,2,4,6,4,6,2,
%T A175462 2,8,2,4,4,2,6,6,4,2,8,4,2,4,2,2,10,4,2,8,4,4,4,2,4,6,4,4,4,2,4,12,4,
%U A175462 2,6,2,4,4,4,4,4,6,2,8,4,6,8,2,2,4,2,4,12,2,2,4,6,2,8,4,2,12,2,4,4,2,8,4,2
%N A175462 Number of divisors of integers of the form 5 + 8n.
%C A175462 All terms are even.
%H A175462 Robert Israel, <a href="/A175462/b175462.txt">Table of n, a(n) for n = 0..10000</a>
%F A175462 a(n) = d(5 + 8*n).
%F A175462 a(n) = A000005(A004770(n)).
%F A175462 Sum_{k=1..n} a(k) ~ (n/2) * (log(n) + 2*gamma - 1 + 5*log(2)), where gamma is Euler's constant (A001620). - _Amiram Eldar_, Jan 14 2024
%p A175462 map(numtheory:-tau,[seq(i,i=5..1000,8)]); # _Robert Israel_, Mar 20 2020
%t A175462 Table[DivisorSigma[0, 8*n + 5], {n, 0, 100}] (* _Amiram Eldar_, Jan 14 2024 *)
%o A175462 (PARI) a(n) = numdiv(5+8*n); \\ _Michel Marcus_, Oct 15 2013
%Y A175462 Cf. A004770 (Numbers of form 8n + 5), A007521 (Primes of form 8n + 5). A000005 (d(n) : number of divisors of n), A001620.
%K A175462 nonn,easy
%O A175462 0,1
%A A175462 _Zak Seidov_, May 23 2010