A254602 Numbers of n-length words on alphabet {0..7} with no subwords ii, where i is from {0..2}.

1, 8, 61, 467, 3574, 27353, 209341, 1602152, 12261769, 93843143, 718210846, 5496691637, 42067895689, 321958728008, 2464050574501, 18858147661547, 144327286503334, 1104581743831073, 8453708639334181, 64698869194494632, 495160627558133329, 3789618738879406463

Offset

0,2

Links

Colin Barker, Table of n, a(n) for n = 0..1000

Index entries for linear recurrences with constant coefficients, signature (7,5).

Formula

G.f.: (1 + x)/(1 - 7*x - 5*x^2).

a(n) = 7*a(n-1) + 5*a(n-2) with n>1, a(0) = 1, a(1) = 8.

a(n) = (2^(-1-n) * ((7-sqrt(69))^n * (-9+sqrt(69)) + (7+sqrt(69))^n * (9+sqrt(69)))) / sqrt(69). - Colin Barker, Sep 08 2016

Maple

A254602:=n->(2^(-1-n) * ((7-sqrt(69))^n * (-9+sqrt(69)) + (7+sqrt(69))^n * (9+sqrt(69)))) / sqrt(69): seq(simplify(A254602(n)), n=0..30); # Wesley Ivan Hurt, Sep 08 2016

Mathematica

RecurrenceTable[{a[0] == 1, a[1] == 8, a[n] == 7 a[n - 1] + 5 a[n - 2]}, a[n], {n, 0, 25}]
LinearRecurrence[{7, 5}, {1, 8}, 30] (* Harvey P. Dale, Jun 23 2017 *)

Prog

(Magma) [n le 1 select 8^n else 7*Self(n)+5*Self(n-1): n in [0..25]];
(PARI) Vec((1+x)/(1-7*x-5*x^2) + O(x^30)) \\ Colin Barker, Sep 08 2016

Crossrefs

Cf. A015562, A055099, A126473, A126501, A126528.

Sequence in context: A081907 A278596 A190976 * A363571 A361772 A327761

Adjacent sequences: A254599 A254600 A254601 * A254603 A254604 A254605

Keyword

nonn,easy

Author

Milan Janjic, Feb 02 2015

Status

approved