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
G.f.: x*(11+5*x) / ( (x-1)^2 ). - R. J. Mathar, Oct 08 2011
From Vincenzo Librandi, Oct 10 2011: (Start)
a(n) = 11 + 16*n;
a(n) = 32*n - a(n-1) + 6, a(0)=11. (End)
MATHEMATICA
Range[11, 1000, 16] (* Vladimir Joseph Stephan Orlovsky, May 31 2011 *)
LinearRecurrence[{2, -1}, {11, 27}, 60] (* Harvey P. Dale, Aug 12 2021 *)
PROG
(Magma) [[ n : n in [1..1000] | n mod 16 eq 11]]; // Vincenzo Librandi, Oct 10 2011
(PARI) a(n)=16*n+11 \\ Charles R Greathouse IV, Oct 16 2015
(Python)
def a(n): return 11 + 16*n
print([a(n) for n in range(53)]) # Michael S. Branicky, Nov 27 2021
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Ralf Stephan, May 03 2005
STATUS
approved