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!)
A090041 a(n) = 10*a(n-1) - 20*a(n-2), a(0)=1, a(1)=6. 2
1, 6, 40, 280, 2000, 14400, 104000, 752000, 5440000, 39360000, 284800000, 2060800000, 14912000000, 107904000000, 780800000000, 5649920000000, 40883200000000, 295833600000000, 2140672000000000, 15490048000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
G.f.: (1-4*x)/(1-10*x+20*x^2) = (1-4*x)/((1-(5-sqrt(5))*x)*(1-(5+sqrt(5))*x)).
E.g.f.: exp(5*x)*(cosh(sqrt(5)*x) + sinh(sqrt(5)*x)/sqrt(5));
a(n) = ((1+sqrt(5))*(5+sqrt(5))^n - (1-sqrt(5))*(5-sqrt(5))^n)/(2*sqrt(5)).
Fifth binomial transform of (1, 1, 5, 5, 25, 25, ...). - Paul Barry, Nov 22 2003
3rd binomial transform of Fibonacci(3n+1). - Paul Barry, Mar 23 2004
a(n) = Sum_{k=0..n} A117317(n,k)*4^k. - Philippe Deléham, Jan 28 2012
CROSSREFS
Sequence in context: A083426 A122471 A178397 * A069720 A005037 A081337
KEYWORD
easy,nonn
AUTHOR
Paul Barry, Nov 20 2003
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 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)