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

 


a(n) = Fibonacci(n-1)^n.
1

%I #8 Sep 08 2022 08:45:55

%S 1,0,1,1,16,243,15625,2097152,815730721,794280046581,2064377754059776,

%T 13931233916552734375,246990403565262140303521,

%U 11447545997288281555215581184,1389897885974444705448234373058929,441692732032956477538220683055593208393

%N a(n) = Fibonacci(n-1)^n.

%H Vincenzo Librandi, <a href="/A182148/b182148.txt">Table of n, a(n) for n = 0..70</a>

%t Table[Fibonacci[n-1]^n,{n,0,20}]

%o (Magma) [Fibonacci(n-1)^n: n in [0..15]];

%Y Cf. A000045, A100399, A210343.

%K nonn,easy

%O 0,5

%A _Vincenzo Librandi_, Jul 04 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 20 17:28 EDT 2024. Contains 376075 sequences. (Running on oeis4.)