OFFSET
0,3
COMMENTS
a(n+1) equals the number of words of length n over {0,1,2,3,4,5,6,7,8} avoiding 01 and 02. - Milan Janjic, Dec 17 2015
LINKS
Colin Barker, Table of n, a(n) for n = 0..1000
Tomislav Doslic, Planar polycyclic graphs and their Tutte polynomials, Journal of Mathematical Chemistry, Volume 51, Issue 6, 2013, pp. 1599-1607. See Cor. 3.7(e).
Index entries for linear recurrences with constant coefficients, signature (9,-2).
FORMULA
a(n) = ((9/2 + 1/2*sqrt(73))^n - (9/2 - 1/2*sqrt(73))^n)/sqrt(79). - Giorgio Balzarotti, May 27 2011
G.f.: x / (1-9*x+2*x^2). - Colin Barker, Feb 26 2016
From G. C. Greubel, Jun 17 2022: (Start)
a(n) = 2^((n-1)/2)*ChebyshevU(n-1, 9*x/(2*sqrt(2))).
E.g.f.: (2/sqrt(73))*exp(9*x/2)*sinh(sqrt(73)*x/2). (End)
MATHEMATICA
LinearRecurrence[{9, -2}, {0, 1}, 50]
PROG
(Magma) I:=[0, 1]; [n le 2 select I[n] else 10*Self(n-1)-2*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Dec 17 2015
(PARI) concat(0, Vec(x/(1-9*x+2*x^2) + O(x^30))) \\ Colin Barker, Feb 26 2016
(SageMath)
A190979 = BinaryRecurrenceSequence(9, -2, 0, 1)
[A190979(n) for n in (0..30)] # G. C. Greubel, Jun 17 2022
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Vladimir Joseph Stephan Orlovsky, May 24 2011
STATUS
approved