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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A190957 a(n) = 10*a(n-1) + 8*a(n-2), with a(0)=0, a(1)=1. 3
0, 1, 10, 108, 1160, 12464, 133920, 1438912, 15460480, 166116096, 1784844800, 19177376768, 206052526080, 2213944274944, 23787862958080, 255590183780352, 2746204741468160, 29506768884924416, 317037326780989440, 3406427418889289728, 36600572803140812800 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
G.f.: x/(1 - 10*x - 8*x^2). - R. J. Mathar, Jun 01 2011
MATHEMATICA
LinearRecurrence[{10, 8}, {0, 1}, 50]
CoefficientList[Series[x/(1-10*x-8*x^2), {x, 0, 50}], x] (* G. C. Greubel, Jan 15 2018 *)
PROG
(PARI) x='x+O('x^30); concat([0], Vec(x/(1-10*x-8*x^2))) \\ G. C. Greubel, Jan 15 2018
(Magma) I:=[0, 1]; [n le 2 select I[n] else 10*Self(n-1) + 8*Self(n-2): n in [1..30]]; // G. C. Greubel, Jan 15 2018
CROSSREFS
Sequence in context: A339117 A157084 A059524 * A163206 A246073 A261920
KEYWORD
nonn,easy
AUTHOR
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 16:38 EDT 2024. Contains 371989 sequences. (Running on oeis4.)