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!)
A110372 a(n) = F(n+1)!/F(n)! where F(n) = n-th Fibonacci number. 0

%I #7 Aug 15 2019 07:27:09

%S 1,2,3,20,336,154440,8204716800,5778574175582208000,

%T 43004718293359780142729736192000000,

%U 1300207208378579462193856077468752280037294977727353323520000000

%N a(n) = F(n+1)!/F(n)! where F(n) = n-th Fibonacci number.

%e a(5) = 8!/5! = 336.

%p with(combinat): seq(fibonacci(n+1)!/fibonacci(n)!,n=1..11); # _Emeric Deutsch_, Jul 25 2005

%Y Cf. A060001.

%K easy,nonn

%O 1,2

%A _Amarnath Murthy_, Jul 24 2005

%E More terms from _Emeric Deutsch_, Jul 25 2005

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 July 17 02:13 EDT 2024. Contains 374360 sequences. (Running on oeis4.)