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!)
A210343 a(n) = Fibonacci(n+1)^n. 4

%I #20 Sep 08 2022 08:46:01

%S 1,1,4,27,625,32768,4826809,1801088541,1785793904896,4605366583984375,

%T 31181719929966183601,552061438912436417593344,

%U 25601832525455335435322705761,3107689015140868348741078056241817,987683253336131809511244100000000000000

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

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

%p a:= n-> (<<1|1>, <1|0>>^n)[1,1]^n:

%p seq(a(n), n=0..15); # _Alois P. Heinz_, Dec 05 2015

%t Table[Fibonacci[n+1]^n,{n,0,100}]

%o (Maxima) makelist(fib(n+1)^n,n,0,14);

%o (Magma) [Fibonacci(n+1)^n: n in [0..14]]; // _Bruno Berselli_, Mar 28 2012

%Y Cf. A100399, A067966, A210341, A210342.

%K nonn,easy

%O 0,3

%A _Emanuele Munarini_, Mar 20 2012

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 19 20:58 EDT 2024. Contains 374436 sequences. (Running on oeis4.)