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 A372713 #26 Jul 19 2024 13:29:17
%S A372713 2,4,3,6,4,6,4,8,4,8,4,9,4,8,6,10,4,8,4,12,6,8,4,12,6,8,5,12,4,12,4,
%T A372713 12,6,8,8,12,4,8,6,16,4,12,4,12,8,8,4,15,6,12,6,12,4,10,8,16,6,8,4,18,
%U A372713 4,8,8,14,8,12,4,12,6,16,4,16,4,8,9,12,8,12,4,20
%N A372713 Number of divisors of 3n; a(n) = tau(3*n) = A000005(3*n).
%C A372713 In general, for p prime, Sum_{j=1..n} tau(j*p) ~ (2*p - 1) * n * (log(n) - 1 + 2*gamma)/p + n*log(p)/p, where gamma is the Euler-Mascheroni constant A001620.
%C A372713 If n is in A033428, then a(n) is odd and vice versa. - _R. J. Mathar_, _Amiram Eldar_, May 20 2024.
%H A372713 Antti Karttunen, <a href="/A372713/b372713.txt">Table of n, a(n) for n = 1..65537</a>
%F A372713 Sum_{k=1..n} a(k) ~ n * (5*(log(n) + 2*gamma - 1) + log(3)) / 3, where gamma is the Euler-Mascheroni constant A001620.
%t A372713 Table[DivisorSigma[0, 3*n], {n, 1, 150}]
%o A372713 (PARI) a(n) = numdiv(3*n); \\ _Michel Marcus_, May 20 2024
%Y A372713 Cf. A000005, A001620, A033428, A099777, A372714, A372715, A372786, A372789, A372792.
%Y A372713 Cf. also A144613.
%K A372713 nonn
%O A372713 1,1
%A A372713 _Vaclav Kotesovec_, May 11 2024