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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A155198 a(n)=9*a(n-1)+a(n-2), n>2 ; a(0)=1, a(1)=8, a(2)=72 . 1
 1, 8, 72, 656, 5976, 54440, 495936, 4517864, 41156712, 374928272, 3415511160, 31114528712, 283446269568, 2582130954824, 23522624862984, 214285754721680, 1952094417358104, 17783135510944616, 162000314015859648 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Index entries for linear recurrences with constant coefficients, signature (9,1). FORMULA G.f.: (1-x-x^2)/(1-9*x-x^2). a(n)=4*{[(9/2)-(1/2)*sqrt(85)]^(n-1)+[(9/2)+(1/2)*sqrt(85)]^(n-1)}+(36/85)*sqrt(85)*{[(9/2)+(1/2)*sqrt(85)]^(n-1)-[(9/2)-(1/2)*sqrt(85)]^(n-1)}+[C(2*n,n) mod 2], with n>=0 [From Paolo P. Lava, Jan 26 2009] a(n) = Sum_{k, 0<=k<=n} A155161(n,k)*8^k. - Philippe Deléham, Feb 08 2012 MATHEMATICA LinearRecurrence[{9, 1}, {1, 8, 72}, 20] (* Harvey P. Dale, Aug 22 2016 *) CROSSREFS Sequence in context: A057091 A156566 A055275 * A147840 A115970 A078995 Adjacent sequences: A155195 A155196 A155197 * A155199 A155200 A155201 KEYWORD nonn,easy AUTHOR Philippe Deléham, Jan 21 2009 STATUS approved

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 December 6 14:43 EST 2022. Contains 358644 sequences. (Running on oeis4.)