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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A168014 Sum of all parts of all partitions of n into equal parts that do not contain 1 as a part. 4
0, 0, 2, 3, 8, 5, 18, 7, 24, 18, 30, 11, 60, 13, 42, 45, 64, 17, 90, 19, 100, 63, 66, 23, 168, 50, 78, 81, 140, 29, 210, 31, 160, 99, 102, 105, 288, 37, 114, 117, 280, 41, 294, 43, 220, 225, 138, 47, 432, 98, 250, 153, 260, 53, 378 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

Sum of all the parts in the partitions of n into two parts such that the smaller part divides the larger. - Wesley Ivan Hurt, Dec 22 2017

LINKS

G. C. Greubel, Table of n, a(n) for n = 0..1000

FORMULA

a(n) = n * A032741(n).

a(n) = n(d(n) - 1) = n*(A000005(n) - 1) = A038040(n) - n, if n >= 1. - Omar E. Pol, Jan 18 2013

MAPLE

A168014:=n->n*(numtheory[tau](n)-1); seq(A168014(k), k=0..60); # Wesley Ivan Hurt, Oct 11 2013

MATHEMATICA

Table[n*(DivisorSigma[0, n] - 1), {n, 0, 100}] (* Wesley Ivan Hurt, Oct 11 2013 *)

CROSSREFS

Cf. A000005, A000041, A032741, A168015, A168020, A168021.

Sequence in context: A094181 A004730 A332460 * A050369 A070935 A095164

Adjacent sequences:  A168011 A168012 A168013 * A168015 A168016 A168017

KEYWORD

easy,nonn

AUTHOR

Omar E. Pol, Nov 20 2009

EXTENSIONS

a(14)-a(55) from Vincenzo Librandi, May 25 2010

New name from Omar E. Pol, Jan 18 2013

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 July 13 13:48 EDT 2020. Contains 335688 sequences. (Running on oeis4.)