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!)
A133407 a(n) = a(n-1) + 5*a(n-2) for n >= 2, a(0)=1, a(1)=2. 3
1, 2, 7, 17, 52, 137, 397, 1082, 3067, 8477, 23812, 66197, 185257, 516242, 1442527, 4023737, 11236372, 31355057, 87536917, 244312202, 681996787, 1903557797, 5313541732, 14831330717, 41399039377, 115555692962, 322550889847 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..1000 (first 100 terms from Matt C. Anderson)
FORMULA
G.f.: (1+x)/(1-x-5*x^2).
a(n) = Sum_{k=0..n+1} A122950(n+1,k)*4^(n+1-k). - Philippe Deléham, Jan 08 2008
a(n) = ((21 - 3*sqrt(21))/42)*(1/2 - (1/2)*sqrt(21))^n + ((21 + 3*sqrt(21))/42)*(1/2 + (1/2)*sqrt(21))^n. - Richard Choulet, Nov 20 2008
MATHEMATICA
LinearRecurrence[{1, 5}, {1, 2}, 30] (* Harvey P. Dale, Jul 23 2013 *)
PROG
(PARI) x='x+O('x^99); Vec((1+x)/(1-x-5*x^2)) \\ Altug Alkan, Aug 28 2017
CROSSREFS
Cf. A030195 (shifted binomial transform).
Sequence in context: A180665 A275209 A007049 * A182667 A067602 A216389
KEYWORD
nonn,easy
AUTHOR
Philippe Deléham, Jan 03 2008
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 06:14 EDT 2024. Contains 371964 sequences. (Running on oeis4.)