This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A027444 a(n) = n^3 + n^2 + n. 21
 0, 3, 14, 39, 84, 155, 258, 399, 584, 819, 1110, 1463, 1884, 2379, 2954, 3615, 4368, 5219, 6174, 7239, 8420, 9723, 11154, 12719, 14424, 16275, 18278, 20439, 22764, 25259, 27930, 30783, 33824, 37059, 40494, 44135, 47988, 52059, 56354, 60879, 65640, 70643, 75894 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS For n>1, a(n) is the volume of a truncated square pyramid with height n and base lengths n+2 and n-1. - Wesley Ivan Hurt, Apr 05 2016 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..1000 D. Applegate, M. LeBrun, N. J. A. Sloane, Dismal Arithmetic, J. Int. Seq. 14 (2011) # 11.9.8. Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets Eric Weisstein's World of Mathematics, Magic Circle - Eric W. Weisstein, Feb 06 2009 Index entries for linear recurrences with constant coefficients, signature (4,-6,4,-1). FORMULA O.g.f.: x*(3+2*x+x^2)/(1-x)^4. - R. J. Mathar, Feb 04 2008 a(n) = 4*a(n-1)-6*a(n-2)+4*a(n-3)-a(n-4) for n>3. - Wesley Ivan Hurt, Apr 05 2016 EXAMPLE For n = 4, 4^3 + 4^2 + 4 = 64 + 16 + 4 = 84. MAPLE A027444:=n->n^3+n^2+n: seq(A027444(n), n=0..100); # Wesley Ivan Hurt, Apr 05 2016 MATHEMATICA lst={}; Do[AppendTo[lst, n^3+n^2+n], {n, 0, 5!}]; lst [Vladimir Joseph Stephan Orlovsky, Nov 20 2008] Table[n^3+n^2+n, {n, 0, 50}] (* Harvey P. Dale, Dec 13 2013 *) PROG (MAGMA) [n^3 + n^2 + n: n in [0..50]]; // Vincenzo Librandi, Jun 09 2011 CROSSREFS Column k=3 of A228275. Cf. A270109. Sequence in context: A141129 A143941 A162147 * A000263 A102590 A174517 Adjacent sequences:  A027441 A027442 A027443 * A027445 A027446 A027447 KEYWORD nonn,easy AUTHOR Patrick De Geest, Mark Milhet (mm992395(AT)shellus.com) 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.