login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A086666 a(n) = sigma_2(n) - sigma_1(n). 2

%I #21 Jan 22 2021 09:01:53

%S 0,2,6,14,20,38,42,70,78,112,110,182,156,226,236,310,272,416,342,504,

%T 468,574,506,790,620,808,780,994,812,1228,930,1302,1172,1396,1252,

%U 1820,1332,1750,1644,2120,1640,2404,1806,2478,2288,2578,2162,3286,2394,3162

%N a(n) = sigma_2(n) - sigma_1(n).

%H Harvey P. Dale, <a href="/A086666/b086666.txt">Table of n, a(n) for n = 1..1000</a>

%H Joerg Arndt, <a href="http://arxiv.org/abs/1202.6525">On computing the generalized Lambert series</a>, arXiv:1202.6525v3 [math.CA], (2012).

%F G.f.: Sum_{n>=1} n*(n-1) * x^n/(1-x^n). - _Joerg Arndt_, Jan 30, 2011

%F L.g.f.: -log(Product_{k>=1} (1 - x^k)^(k-1)) = Sum_{n>=1} a(n)*x^n/n. - _Ilya Gutkovskiy_, May 21 2018

%F From _Peter Bala_, Jan 21 20221; (Start)

%F a(n) = 2*A069153(n).

%F G.f.: A(x) = Sum_{n >= 1} 2*x^(2*n)/(1 - x^n)^3.

%F A faster converging series: A(x) = Sum_{n >= 1} x^(n^2)*( n*(n-1)*x^(3*n) - (n^2 + n - 2)*x^(2*n) + n*(3 - n)*x^n + n*(n - 1) )/(1 - x^n)^3 - differentiate equation 5 in Arndt twice w.r.t x and set x = 1. (End)

%t Table[DivisorSigma[2,n]-DivisorSigma[1,n],{n,50}] (* _Harvey P. Dale_, Aug 01 2020 *)

%o (PARI) for (n=2,50,print1(sigma(n,2)-sigma(n,1)","))

%Y Cf. A000203, A001157, A052847, A069153, A092348.

%K nonn,easy

%O 1,2

%A _Jon Perry_, Jul 27 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 06:49 EDT 2024. Contains 371964 sequences. (Running on oeis4.)