OFFSET
0,2
LINKS
Ivan Panchenko, Table of n, a(n) for n = 0..200
Tanya Khovanova, Recursive Sequences.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 331.
Luis Manuel Rivera, Integer sequences and k-commuting permutations, arXiv preprint arXiv:1406.3081 [math.CO], 2014-2015.
Index entries for linear recurrences with constant coefficients, signature (2,-1).
FORMULA
(floor(a(n)/10) + 2*(a(n) mod 10)) == 0 modulo 19, see A076312. - Reinhard Zumkeller, Oct 06 2002
From Vincenzo Librandi, Dec 24 2010: (Start)
a(n) = 19*n.
a(n) = 2*a(n-1) - a(n-2).
G.f.: 19*x/(x-1)^2. (End)
From Elmo R. Oliveira, Apr 10 2025: (Start)
E.g.f.: 19*x*exp(x).
MATHEMATICA
Range[0, 1500, 19] (* Vladimir Joseph Stephan Orlovsky, Jun 01 2011 *)
PROG
(PARI) a(n)=19*n; \\ Michel Marcus, Dec 27 2014
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved