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!)
A060001 a(n) = Fibonacci(n)!. 6

%I #26 Nov 20 2020 08:41:54

%S 1,1,2,6,120,40320,6227020800,51090942171709440000,

%T 295232799039604140847618609643520000000,

%U 12696403353658275925965100847566516959580321051449436762275840000000000000

%N a(n) = Fibonacci(n)!.

%H Harry J. Smith, <a href="/A060001/b060001.txt">Table of n, a(n) for n=1..14</a>

%F From _Amiram Eldar_, Nov 20 2020: (Start)

%F a(n) = A000142(A000045(n)).

%F Sum_{n>=1} 1/a(n) = A327558. (End)

%t Array[Fibonacci[ # ]!&,12] (* _Vladimir Joseph Stephan Orlovsky_, Nov 01 2009 *)

%o (PARI) a(n) = fibonacci(n)!; \\ _Harry J. Smith_, Jul 01 2009

%o (Sage) [factorial(fibonacci(n)) for n in range(0, 15)] # _Zerinvary Lajos_, Nov 29 2009

%Y Cf. A000045, A000142, A003266, A066526, A327558.

%K nonn

%O 1,3

%A _Jason Earls_, Mar 14 2001

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 March 28 09:04 EDT 2024. Contains 371240 sequences. (Running on oeis4.)