login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A141670 a(n) = NumberOfPartitions(n) * ( tau(n)-1 ). 1
0, 2, 3, 10, 7, 33, 15, 66, 60, 126, 56, 385, 101, 405, 528, 924, 297, 1925, 490, 3135, 2376, 3006, 1255, 11025, 3916, 7308, 9030, 18590, 4565, 39228, 6842, 41745, 30429, 36930, 44649, 143816, 21637, 78045, 93555, 261366, 44583, 372218, 63261, 375875, 445670, 316674, 124754, 1325457 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

G. C. Greubel, Table of n, a(n) for n = 1..5000

FORMULA

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

MATHEMATICA

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

CROSSREFS

Cf. A000005, A000041.

Sequence in context: A163767 A128531 A123167 * A278561 A193729 A303115

Adjacent sequences:  A141667 A141668 A141669 * A141671 A141672 A141673

KEYWORD

nonn

AUTHOR

Roger L. Bagula and Gary W. Adamson, Sep 06 2008

EXTENSIONS

Terms a(31) onward added by G. C. Greubel, Jun 10 2018

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 19 03:27 EST 2019. Contains 329310 sequences. (Running on oeis4.)