OFFSET
0,1
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..10000
Tanya Khovanova, Recursive Sequences
Index entries for linear recurrences with constant coefficients, signature (2,-1).
FORMULA
a(n) = 8*n + 11. - Vincenzo Librandi, Jul 12 2011
From G. C. Greubel, Oct 13 2018: (Start)
a(n) = 2*a(n-1) - a(n-2).
G.f.: (11 - 3*x)/(1-x)^2.
E.g.f.: (8*x + 11)*exp(x). (End)
MATHEMATICA
Table[8*n+11, {n, 0, 60}] (* G. C. Greubel, Oct 13 2018 *)
LinearRecurrence[{2, -1}, {11, 19}, 80] (* Harvey P. Dale, Aug 09 2023 *)
PROG
(Magma) [8*n+11: n in [0..60]]; // Vincenzo Librandi, Jul 12 2011
(PARI) a(n)=8*n+11 \\ Charles R Greathouse IV, Jul 11 2016
CROSSREFS
KEYWORD
nonn,easy,base
AUTHOR
STATUS
approved