login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A162264 a(n) = (2*n^3 + 5*n^2 + 7*n)/2. 1
7, 25, 60, 118, 205, 327, 490, 700, 963, 1285, 1672, 2130, 2665, 3283, 3990, 4792, 5695, 6705, 7828, 9070, 10437, 11935, 13570, 15348, 17275, 19357, 21600, 24010, 26593, 29355, 32302, 35440, 38775, 42313, 46060, 50022, 54205, 58615, 63258 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

Index entries for linear recurrences with constant coefficients, signature (4,-6,4,-1).

FORMULA

Row sums from A154681: a(n) = Sum_{m=1..n} (2*m*n + m + n + 3).

From Vincenzo Librandi, Mar 05 2012: (Start)

G.f.: x*(7 - 3*x + 2*x^2)/(1-x)^4.

a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4). (End)

MATHEMATICA

LinearRecurrence[{4, -6, 4, -1}, {7, 25, 60, 118}, 50] (* or *) CoefficientList[Series[(7-3*x+2*x^2)/(1-x)^4, {x, 0, 40}], x] (* Vincenzo Librandi, Mar 05 2012 *)

CROSSREFS

Cf. A154681.

Sequence in context: A110672 A213481 A266709 * A034135 A212136 A213392

Adjacent sequences: A162261 A162262 A162263 * A162265 A162266 A162267

KEYWORD

nonn,easy

AUTHOR

Vincenzo Librandi, Jun 29 2009

EXTENSIONS

New name from Vincenzo Librandi, Mar 05 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 9 19:36 EST 2022. Contains 358703 sequences. (Running on oeis4.)