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

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A154560 (n+3)^2*n/2 + 1. 4
 1, 9, 26, 55, 99, 161, 244, 351, 485, 649, 846, 1079, 1351, 1665, 2024, 2431, 2889, 3401, 3970, 4599, 5291, 6049, 6876, 7775, 8749, 9801, 10934, 12151, 13455, 14849, 16336, 17919, 19601, 21385, 23274, 25271, 27379, 29601, 31940, 34399, 36981 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS 8*a(n) is the y value of a solution (x, y) to the Diophantine equation 2*x^3+12*x^2 = y^2. The corresponding x value is A152811(n+1). LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..10000 Index entries for linear recurrences with constant coefficients, signature (4,-6,4,-1). FORMULA G.f.: (1+5*x-4*x^2+x^3)/(1-x)^4. a(n) = A058794(n)/2. a(n) = A117560(n+2) - n - 1. a(2*n) = A144129(n+1). a(2*n-1) = A141530(n+1).  a(n) = -a(-n-4). - Bruno Berselli, Sep 05 2011 EXAMPLE a(5) = (5+3)^2*5/2+1 = 64*5/2+1 = 161. PROG (PARI) {for(n=0, 40, print1((n+3)^2*n/2+1, ", "))} (MAGMA) [(n+3)^2*n/2 + 1: n in [0..50]]; // Vincenzo Librandi, Sep 06 2011 CROSSREFS Cf. A058794 (row 3 of A007754), A117560 (n*(n^2-1)/2-1), A144129 (4*n^3-3*n), A141530, A152811 (2*(n^2+2*n-2)). Sequence in context: A085367 A081267 A052153 * A249275 A270695 A048468 Adjacent sequences:  A154557 A154558 A154559 * A154561 A154562 A154563 KEYWORD nonn,easy AUTHOR Klaus Brockhaus, Jan 12 2009 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 January 22 07:39 EST 2020. Contains 331139 sequences. (Running on oeis4.)