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!)
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
PROG
(Haskell)
a061259 n = sum $ zipWith (*) divs $ map a000041 divs
where divs = a027750_row' n
-- Reinhard Zumkeller, Oct 31 2015
CROSSREFS
Sequence in context: A078308 A083493 A338046 * A072421 A163477 A084664
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 02:23 EDT 2024. Contains 371264 sequences. (Running on oeis4.)