OFFSET
0,1
LINKS
Tanya Khovanova, Recursive Sequences
Index entries for linear recurrences with constant coefficients, signature (1, 1).
FORMULA
a(n) = a(n-1) + a(n-2) for n > 1, a(0) = 11, a(1) = 23.
G.f.: (11 + 12*x)/(1 - x - x^2). - Philippe Deléham, Nov 20 2008
a(n) = h*Fibonacci(n+k) + Fibonacci(n+k-h) with h=7, k=3. - Bruno Berselli, Feb 20 2017
MATHEMATICA
a[0] := 11; a[1] := 23; a[n_] := a[n - 1] + a[n - 2]; Table[a[n], {n, 0, 25}] (* Stefan Steinerberger, Mar 06 2006 *)
PROG
(PARI) a(n)=([0, 1; 1, 1]^n*[11; 23])[1, 1] \\ Charles R Greathouse IV, Feb 20 2017
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Parthasarathy Nambi, Sep 20 2004
EXTENSIONS
More terms from Stefan Steinerberger, Mar 06 2006
STATUS
approved