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

Logo
Hints
(Greetings fromThe On-Line Encyclopedia of Integer Sequences!)
A084329 a(0)=0, a(1)=1, a(n)=20a(n-1)-20a(n-2). 1
0, 1, 20, 380, 7200, 136400, 2584000, 48952000, 927360000, 17568160000, 332816000000, 6304956800000, 119442816000000, 2262757184000000, 42866287360000000, 812070603520000000, 15384086323200000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n)=(1/8)*sum(k=0, n, binomial(n, k)*F(6*k)) where F(k) denotes the k-th Fibonacci number.
G.f.: x/(1-20x+20x^2).
MATHEMATICA
Union[Flatten[NestList[{#[[2]], 20(#[[2]]-#[[1]])}&, {0, 1}, 20]]] (*Harvey P. Dale,Feb 24 2011 *)
LinearRecurrence[{20, -20}, {0, 1}, 20] (*Harvey P. Dale,Nov 29 2019 *)
PROG
(PARI) a(n)=(1/8)*sum(k=0, n, binomial(n, k)*fibonacci(6*k))
(PARI) a(n)=imag((6+8*quadgen(5))^n)/8
CROSSREFS
KEYWORD
nonn
AUTHOR
Benoit Cloitre,Jun 21 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 byThe OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 15 04:39 EDT 2024. Contains 375931 sequences. (Running on oeis4.)