The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A245524 a(n) = n^2 - floor(n/2)*(-1)^n. 2
 1, 3, 10, 14, 27, 33, 52, 60, 85, 95, 126, 138, 175, 189, 232, 248, 297, 315, 370, 390, 451, 473, 540, 564, 637, 663, 742, 770, 855, 885, 976, 1008, 1105, 1139, 1242, 1278, 1387, 1425, 1540, 1580, 1701, 1743, 1870, 1914, 2047, 2093, 2232, 2280, 2425, 2475 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Consider the partitions of 2n into two parts: When n is odd, a(n) gives the total sum of the even numbers from the smallest parts and the odd numbers from the largest parts of these partitions. When n is even, a(n) gives the total sum of the odd numbers from the smallest parts and the even numbers from the largest parts (see example). LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..1000 Index entries for linear recurrences with constant coefficients, signature (1,2,-2,-1,1). FORMULA a(n) = (4*n^2 - 1 - (2*n - 1)*(-1)^n) / 4. a(n) = A000290(n) - A001057(n-1), n > 0. G.f.: x*(1+2*x+5*x^2)/((1+x)^2*(1-x)^3). - Robert Israel, Jul 25 2014 a(n) = (2*n-1)*(n-floor(n/2)). - Wesley Ivan Hurt, Jan 10 2017 a(n) = n^2 + Sum_{k=1..n-1} (-1)^k*k for n>1. Example: for n=5, a(5) = 5^2 + (4 - 3 + 2 - 1) = 27. - Bruno Berselli, May 23 2018 EXAMPLE a(3) = 10; The partitions of 2*3 = 6 into two parts are: (5,1), (4,2), (3,3). Since 3 is odd, we sum the even numbers from the smallest parts together with the odd numbers from the largest parts to get: (2) + (3+5) = 10. a(4) = 14; The partitions of 4*2 = 8 into two parts are: (7,1), (6,2), (5,3), (4,4). Since 4 is even, we sum the odd numbers from the smallest parts together with the even numbers from the largest parts to get: (1+3) + (4+6) = 14. MAPLE A245524:=n->n^2-floor(n/2)*(-1)^n: seq(A245524(n), n=1..50); MATHEMATICA Table[n^2 - Floor[n/2] (-1)^n, {n, 50}] CoefficientList[Series[(1 + 2 x + 5 x^2)/((1 + x)^2 (1 - x)^3), {x, 0, 50}], x] (* Vincenzo Librandi, Jul 25 2014 *) PROG (MAGMA) [n^2-Floor(n/2)*(-1)^n : n in [1..50]]; CROSSREFS Cf. A000290, A001057. Sequence in context: A063796 A063221 A022409 * A023866 A024593 A128930 Adjacent sequences:  A245521 A245522 A245523 * A245525 A245526 A245527 KEYWORD nonn,easy AUTHOR Wesley Ivan Hurt, Jul 24 2014 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.

Last modified September 21 15:27 EDT 2021. Contains 347598 sequences. (Running on oeis4.)