OFFSET
0,2
COMMENTS
a(n-1) = Sum(P(19;n-1-k,k),k=0..ceiling((n-1)/2)), n>=1, with a(-1)=18. These are the SW-NE diagonals in P(19;n,k), the (19,1) Pascal triangle. Cf. A093645 for the (10,1) Pascal triangle. Observation by Paul Barry, Apr 29 2004. Proof via recursion relations and comparison of inputs.
LINKS
Paolo Xausa, Table of n, a(n) for n = 0..1000
Tanya Khovanova, Recursive Sequences
Index entries for linear recurrences with constant coefficients, signature (1,1).
FORMULA
a(n) = a(n-1)+a(n-2), n >= 2, a(0) = 1, a(1) = 19.
G.f.: (1+18*x)/(1-x-x^2).
MATHEMATICA
LinearRecurrence[{1, 1}, {1, 19}, 35] (* Paolo Xausa, Feb 22 2024 *)
PROG
(Magma) a0:=1; a1:=19; [GeneralizedFibonacciNumber(a0, a1, n): n in [0..30]]; // Bruno Berselli, Feb 12 2013
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved