OFFSET
0,2
COMMENTS
Length-n words from letters {1, 2, ..., 8} with at least one letter greater than 3. - Joerg Arndt, Jun 02 2011
All terms are odd multiples of 5, since the powers of 8 mod 10 are 8, 4, 2, 6, ... and the powers of 3 mod 10 are 3, 9, 7, 1, ... - Alonso del Arte, Feb 25 2014
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..300
Feryal Alayont and Evan Henning, Edge Covers of Caterpillars, Cycles with Pendants, and Spider Graphs, J. Int. Seq. (2023) Vol. 26, Art. 23.9.4.
Index entries for linear recurrences with constant coefficients, signature (11,-24).
FORMULA
a(n) = 11*a(n-1) - 24*a(n-2).
G.f.: 5*x/((1-3*x)*(1-8*x)). - Vincenzo Librandi, Oct 05 2014
a(n+1) = 5*A016140(n). - Vincenzo Librandi, Oct 05 2014
MAPLE
MATHEMATICA
Table[8^n - 3^n, {n, 0, 19}] (* Alonso del Arte, Feb 25 2014 *)
CoefficientList[Series[5 x/((1 - 3 x) (1 - 8 x)), {x, 0, 30}], x] (* Vincenzo Librandi, Oct 05 2014 *)
PROG
(Magma) [8^n - 3^n: n in [0..30]]
(PARI) a(n)=8^n-3^n \\ Charles R Greathouse IV, Jun 02 2011
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Vincenzo Librandi, Jun 02 2011
STATUS
approved