OFFSET
0,1
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Richard P. Brent, Generalising Tuenter's binomial sums, arXiv:1407.3533 [math.CO], 2014 (page 16).
Index entries for linear recurrences with constant coefficients, signature (4,-6,4,-1).
FORMULA
O.g.f.: (-427 + 1709*x - 2201*x^2 + 3223*x^3)/(1-x)^4.
E.g.f.: (-427 + 428*x - 32*x^2 + 384*x^3)*exp(x).
a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) for n>3.
See page 7 in Brent's paper:
A272132(n) = (2*n-1)^2*a(n) - 4*(n-1)^2*a(n-1).
n*a(n) = 1 + 3^7*(n-1)/(n+1) + 5^7*((n-1)*(n-2))/((n+1)*(n+2)) + ... for n >= 1. See A245244. - Peter Bala, Jan 19 2019
MAPLE
[384*n^3-1184*n^2+1228*n-427$n=0..35]; # Muniru A Asiru, Jan 28 2019
MATHEMATICA
Table[384 n^3 - 1184 n^2 + 1228 n - 427, {n, 0, 40}]
LinearRecurrence[{4, -6, 4, -1}, {-427, 1, 365, 2969}, 40] (* Harvey P. Dale, Aug 24 2024 *)
PROG
(Magma) [384*n^3 - 1184*n^2 + 1228*n - 427: n in [0..50]];
(PARI) lista(nn) = for(n=0, nn, print1(384*n^3-1184*n^2+1228*n-427, ", ")); \\ Altug Alkan, Apr 26 2016
CROSSREFS
KEYWORD
sign,easy
AUTHOR
Vincenzo Librandi, Apr 26 2016
STATUS
approved