OFFSET
0,2
COMMENTS
The sequence is constructed from a truncated version of Pascal's Triangle. See A370074 for an example. a(n) arises from the Gambler's Ruin problem and represents the number of ways a gambler is ruined after starting with $8 with a maximum $11 causing retirement.
LINKS
Paolo Xausa, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (9,-28,35,-15,1).
FORMULA
a(n) = 9*a(n-1)-28*a(n-2)+35*a(n-3)-15*a(n-4)+a(n-5) for n>=5.
MATHEMATICA
LinearRecurrence[{9, -28, 35, -15, 1}, {1, 8, 44, 207, 896}, 25] (* Paolo Xausa, Jun 09 2024 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Peter Morris, Feb 22 2024
STATUS
approved