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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A309372 a(n) = n^2 - n^3 + n^4. 1
 0, 1, 12, 63, 208, 525, 1116, 2107, 3648, 5913, 9100, 13431, 19152, 26533, 35868, 47475, 61696, 78897, 99468, 123823, 152400, 185661, 224092, 268203, 318528, 375625, 440076, 512487, 593488, 683733, 783900, 894691, 1016832, 1151073, 1298188, 1458975, 1634256, 1824877, 2031708, 2255643, 2497600 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Colin Barker, Table of n, a(n) for n = 0..1000 Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1). FORMULA From Colin Barker, Aug 11 2019: (Start) G.f.: x*(1 + 3*x)*(1 + 4*x + x^2) / (1 - x)^5. a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5) for n>5. (End) EXAMPLE a(4) = 4^2 - 4^3 + 4^4 = 16 - 64 + 256 = 208. PROG (Python) for x in range(100): print((x**2)-(x**3)+(x**4)) (PARI) concat(0, Vec(x*(1 + 3*x)*(1 + 4*x + x^2) / (1 - x)^5 + O(x^40))) \\ Colin Barker, Aug 11 2019 CROSSREFS Cf. A132998. Sequence in context: A335252 A212509 A212249 * A085463 A051922 A027810 Adjacent sequences: A309369 A309370 A309371 * A309373 A309374 A309375 KEYWORD nonn,easy AUTHOR John H. Chakkour, Aug 02 2019 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.

Last modified February 24 15:13 EST 2024. Contains 370305 sequences. (Running on oeis4.)