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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A191465 a(n) = 9^n - 2^n. 4
 0, 7, 77, 721, 6545, 59017, 531377, 4782841, 43046465, 387419977, 3486783377, 31381057561, 282429532385, 2541865820137, 22876792438577, 205891132061881, 1853020188786305, 16677181699535497, 150094635296736977, 1350851717672467801 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS a(n) is the number of words of length n over the alphabet {1,2,...,9} where at least one letter >= 3 appears. - Joerg Arndt, Jan 18 2024 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..300 Index entries for linear recurrences with constant coefficients, signature (11,-18). FORMULA a(n) = 11*a(n-1) - 18*a(n-2). G.f.: 7*x/((1-2*x)*(1-9*x)). - Vincenzo Librandi, Oct 04 2014 a(n) = 7*A016133(n-1). - R. J. Mathar, Mar 10 2022 MATHEMATICA Table[9^n-2^n, {n, 0, 20}] (* Harvey P. Dale, Apr 16 2014 *) PROG (PARI) a(n)=9^n-1<

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

Last modified July 21 14:09 EDT 2024. Contains 374474 sequences. (Running on oeis4.)