|
%I #32 Dec 26 2017 17:34:58
%S 0,0,2,3,8,5,18,7,24,18,30,11,60,13,42,45,64,17,90,19,100,63,66,23,
%T 168,50,78,81,140,29,210,31,160,99,102,105,288,37,114,117,280,41,294,
%U 43,220,225,138,47,432,98,250,153,260,53,378
%N Sum of all parts of all partitions of n into equal parts that do not contain 1 as a part.
%C 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
%H G. C. Greubel, <a href="/A168014/b168014.txt">Table of n, a(n) for n = 0..1000</a>
%F a(n) = n * A032741(n).
%F a(n) = n(d(n) - 1) = n*(A000005(n) - 1) = A038040(n) - n, if n >= 1. - _Omar E. Pol_, Jan 18 2013
%p A168014:=n->n*(numtheory[tau](n)-1); seq(A168014(k), k=0..60); # _Wesley Ivan Hurt_, Oct 11 2013
%t Table[n*(DivisorSigma[0, n] - 1), {n, 0, 100}] (* _Wesley Ivan Hurt_, Oct 11 2013 *)
%Y Cf. A000005, A000041, A032741, A168015, A168020, A168021.
%K easy,nonn
%O 0,3
%A _Omar E. Pol_, Nov 20 2009
%E a(14)-a(55) from _Vincenzo Librandi_, May 25 2010
%E New name from _Omar E. Pol_, Jan 18 2013
|
