The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A277672 Number of n-length words over a 9-ary alphabet {a_1,a_2,...,a_9} avoiding consecutive letters a_i, a_{i+1}. 2
 1, 9, 73, 592, 4801, 38935, 315754, 2560693, 20766637, 168412696, 1365788605, 11076234500, 89825738954, 728466283251, 5907695633935, 47910065991605, 388539722685585, 3150968653039294, 25553638078006016, 207234184444162395, 1680622033979603605 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..1000 Index entries for linear recurrences with constant coefficients, signature (9,-8,7,-6,5,-4,3,-2,1) FORMULA G.f.: 1/(1 + Sum_{j=1..9} (10-j)*(-x)^j). MAPLE a:= proc(n) option remember; `if`(n<0, 0, `if`(n=0, 1,       -add((-1)^j*(10-j)*a(n-j), j=1..9)))     end: seq(a(n), n=0..25); MATHEMATICA LinearRecurrence[{9, -8, 7, -6, 5, -4, 3, -2, 1}, {1, 9, 73, 592, 4801, 38935, 315754, 2560693, 20766637}, 30] (* Harvey P. Dale, Apr 03 2019 *) CROSSREFS Column k=9 of A277666. Sequence in context: A081627 A164588 A023001 * A015454 A343353 A121246 Adjacent sequences:  A277669 A277670 A277671 * A277673 A277674 A277675 KEYWORD nonn,easy AUTHOR Alois P. Heinz, Oct 26 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 28 15:20 EST 2022. Contains 350657 sequences. (Running on oeis4.)