OFFSET
0,3
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Ulrich Brenner, Anna Hermann, and Jannik Silvanus, Constructing Depth-Optimum Circuits for Adders and AND-OR Paths, arXiv:2012.05550 [cs.DM], 2020.
Index entries for linear recurrences with constant coefficients, signature (5,-4,1).
FORMULA
a(n+3) = 5*a(n+2) - 4*a(n+1) + a(n).
G.f.: x/(1-5*x+4*x^2-x^3). - Colin Barker, Feb 03 2012
EXAMPLE
G.f. = x + 5*x^2 + 21*x^3 + 86*x^4 + 351*x^5 + 1432*x^6 + 5842*x^7 + ...
MATHEMATICA
LinearRecurrence[{5, -4, 1}, {0, 1, 5}, 25] (* Vincenzo Librandi, Feb 03 2012 *)
PROG
(Magma) I:=[0, 1, 5 ]; [n le 3 select I[n] else 5*Self(n-1)-4*Self(n-2)+Self(n-3): n in [1..40]]; // Vincenzo Librandi, Feb 03 2012
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
EXTENSIONS
Initial term 0 added by Colin Barker, Feb 03 2012
STATUS
approved