|
%I #60 Sep 08 2022 08:45:20
%S 0,0,2,2,6,6,12,12,20,20,30,30,42,42,56,56,72,72,90,90,110,110,132,
%T 132,156,156,182,182,210,210,240,240,272,272,306,306,342,342,380,380,
%U 420,420,462,462,506,506,552,552,600,600,650,650,702,702,756,756,812,812
%N Oblong (promic) numbers repeated.
%C a(floor(n/2)) = A002378(n).
%C Sum of the even numbers among the smallest parts in the partitions of 2n into two parts (see example). - _Wesley Ivan Hurt_, Jul 25 2014
%C For n > 0, a(n-1) is the sum of the smallest parts of the partitions of 2n into two distinct even parts. - _Wesley Ivan Hurt_, Dec 06 2017
%H G. C. Greubel, <a href="/A110660/b110660.txt">Table of n, a(n) for n = 0..5000</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PronicNumber.html">Pronic Number</a>
%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,2,-2,-1,1).
%F a(n) = floor(n/2) * (floor(n/2)+1).
%F a(n) = A028242(n) * A110654(n).
%F a(n) = A008805(n-2)*2, with A008805(-2) = A008805(-1) = 0.
%F From _Wesley Ivan Hurt_, Jul 25 2014: (Start)
%F G.f.: 2*x^2/((1-x)^3*(1+x)^2);
%F a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3) - a(n-4) + a(n-5), for n > 4;
%F a(n) = (2*n^2 + 2*n - 1 + (2*n + 1)*(-1)^n)/8. (End)
%F a(n) = Sum_{i=1..n; i even} i. - _Olivier Pirson_, Nov 05 2017
%e a(4) = 6; The partitions of 2*4 = 8 into two parts are: (7,1), (6,2), (5,3), (4,4). The sum of the even numbers from the smallest parts of these partitions gives: 2 + 4 = 6.
%e a(5) = 6; The partitions of 2*5 = 10 into two parts are: (9,1), (8,2), (7,3), (6,4), (5,5). The sum of the even numbers from the smallest parts of these partitions gives: 2 + 4 = 6.
%p A110660:=n->floor(n/2)*(floor(n/2)+1): seq(A110660(n), n=0..50); # _Wesley Ivan Hurt_, Jul 25 2014
%t Table[Floor[n/2] (Floor[n/2] + 1), {n, 0, 50}] (* _Wesley Ivan Hurt_, Jul 25 2014 *)
%t CoefficientList[Series[2*x^2/((1 - x)^3*(1 + x)^2), {x, 0, 50}], x] (* _Wesley Ivan Hurt_, Jul 25 2014 *)
%t LinearRecurrence[{1,2,-2,-1,1},{0,0,2,2,6},60] (* _Harvey P. Dale_, Jan 23 2021 *)
%o (Magma) k:=1; f:=func<n | n*(k*n+1)>; [0] cat [f(n*m): m in [-1,1], n in [1..30]]; // _Bruno Berselli_, Nov 14 2012
%o (PARI) a(n)=n\=2;n*(n+1) \\ _Charles R Greathouse IV_, Jul 05 2013
%Y Cf. A109613.
%Y Partial sums give A006584.
%K nonn,easy
%O 0,3
%A _Reinhard Zumkeller_, Aug 05 2005
%E Typo in description (Name) fixed by _Harvey P. Dale_, Jul 09 2021
|
