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!)
A084329 a(0)=0, a(1)=1, a(n)=20a(n-1)-20a(n-2). 1

%I #17 Jan 01 2024 11:18:09

%S 0,1,20,380,7200,136400,2584000,48952000,927360000,17568160000,

%T 332816000000,6304956800000,119442816000000,2262757184000000,

%U 42866287360000000,812070603520000000,15384086323200000000

%N a(0)=0, a(1)=1, a(n)=20a(n-1)-20a(n-2).

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (20,-20).

%F a(n)=(1/8)*sum(k=0, n, binomial(n, k)*F(6*k)) where F(k) denotes the k-th Fibonacci number.

%F G.f.: x/(1-20x+20x^2).

%t Union[Flatten[NestList[{#[[2]],20(#[[2]]-#[[1]])}&,{0,1},20]]] (* _Harvey P. Dale_, Feb 24 2011 *)

%t LinearRecurrence[{20,-20},{0,1},20] (* _Harvey P. Dale_, Nov 29 2019 *)

%o (PARI) a(n)=(1/8)*sum(k=0,n,binomial(n,k)*fibonacci(6*k))

%o (PARI) a(n)=imag((6+8*quadgen(5))^n)/8

%Y Cf. A030191.

%K nonn

%O 0,3

%A _Benoit Cloitre_, Jun 21 2003

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 04:29 EDT 2024. Contains 371782 sequences. (Running on oeis4.)