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!)
A141670 a(n) = NumberOfPartitions(n) * ( tau(n)-1 ). 1

%I #11 Mar 09 2023 15:13:12

%S 0,2,3,10,7,33,15,66,60,126,56,385,101,405,528,924,297,1925,490,3135,

%T 2376,3006,1255,11025,3916,7308,9030,18590,4565,39228,6842,41745,

%U 30429,36930,44649,143816,21637,78045,93555,261366,44583,372218,63261,375875,445670,316674,124754,1325457

%N a(n) = NumberOfPartitions(n) * ( tau(n)-1 ).

%H G. C. Greubel, <a href="/A141670/b141670.txt">Table of n, a(n) for n = 1..5000</a>

%F a(n) = A000041(n)*( A000005(n)-1 ) = A000041(n) * A032741(n).

%t f[n_] = DivisorSigma[0, n]*PartitionsP[n] - PartitionsP[n]; Table[f[n], {n, 1, 30}]

%Y Cf. A000005, A000041, A032741.

%K nonn

%O 1,2

%A _Roger L. Bagula_ and _Gary W. Adamson_, Sep 06 2008

%E Terms a(31) onward added by _G. C. Greubel_, Jun 10 2018

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 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)