cp's OEIS Frontend

A359211 a(n) = tau(3*n-1)/2, where tau(n) = number of divisors of n, cf. A000005.

%I A359211 #33 Feb 02 2024 11:10:45
%S A359211 1,1,2,1,2,1,3,1,2,1,3,2,2,1,3,1,3,1,4,1,2,2,3,1,2,2,5,1,2,1,3,2,3,1,
%T A359211 4,1,4,1,3,2,2,2,4,1,2,1,6,2,2,1,4,2,2,2,3,1,4,1,5,1,4,2,3,1,2,1,6,2,
%U A359211 2,2,3,2,2,2,6,1,4,1,3,1,3,3,4,1,2,1,6,1,4,1
%N A359211 a(n) = tau(3*n-1)/2, where tau(n) = number of divisors of n, cf. A000005.
%C A359211 Also number of divisors of 3*n-1 of form 3*k+1 (or 3*k+2).
%H A359211 Seiichi Manyama, <a href="/A359211/b359211.txt">Table of n, a(n) for n = 1..10000</a>
%F A359211 G.f.: Sum_{k>0} x^k/(1 - x^(3*k-1)).
%F A359211 G.f.: Sum_{k>0} x^(2*k-1)/(1 - x^(3*k-2)).
%F A359211 Sum_{k=1..n} a(k) = (log(n) + 2*gamma - 1 + 2*log(3))*n/3 + O(n^(1/3)*log(n)), where gamma is Euler's constant (A001620). - _Amiram Eldar_, Dec 26 2022
%t A359211 a[n_] := DivisorSigma[0, 3*n-1]/2; Array[a, 100] (* _Amiram Eldar_, Dec 21 2022 *)
%o A359211 (PARI) a(n) = numdiv(3*n-1)/2;
%o A359211 (PARI) a(n) = sumdiv(3*n-1, d, d%3==1);
%o A359211 (PARI) a(n) = sumdiv(3*n-1, d, d%3==2);
%o A359211 (PARI) my(N=100, x='x+O('x^N)); Vec(sum(k=1, N, x^k/(1-x^(3*k-1))))
%o A359211 (PARI) my(N=100, x='x+O('x^N)); Vec(sum(k=1, N, x^(2*k-1)/(1-x^(3*k-2))))
%Y A359211 Cf. A078703, A099774.
%Y A359211 Cf. A000005, A001620, A001817, A001822, A359212.
%K A359211 nonn,easy
%O A359211 1,3
%A A359211 _Seiichi Manyama_, Dec 21 2022