login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A061259 a(n)=Sum_{d|n} d*numbpart(d), where numbpart(d)=number of partitions of d, cf. A000041. 3
1, 5, 10, 25, 36, 80, 106, 201, 280, 460, 617, 1024, 1314, 2000, 2685, 3897, 5050, 7280, 9311, 13020, 16747, 22665, 28866, 39000, 48986, 64654, 81550, 106124, 132386, 171295, 212103, 271065, 335345, 423594, 521046, 655396, 800570, 997885 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..1000

PROG

(Haskell)

a061259 n = sum $ zipWith (*) divs $ map a000041 divs

            where divs = a027750_row' n

-- Reinhard Zumkeller, Oct 31 2015

CROSSREFS

Cf. A000041, A057660, A001001, A060640, A061258.

Cf. A001970, A027750.

Sequence in context: A289320 A078308 A083493 * A072421 A163477 A084664

Adjacent sequences:  A061256 A061257 A061258 * A061260 A061261 A061262

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic, Apr 21 2001

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 January 17 14:57 EST 2020. Contains 330958 sequences. (Running on oeis4.)