A215270 a(n) = a(n-1)*a(n-2) with a(0)=1, a(1)=6.
1, 6, 6, 36, 216, 7776, 1679616, 13060694016, 21936950640377856, 286511799958070431838109696, 6285195213566005335561053533150026217291776, 1800782593726645086383198950649858141454002621435149880441896326660096
Offset: 0
Links
- Bruno Berselli, Table of n, a(n) for n = 0..15
- W. W. Adams and J. L. Davison, A remarkable class of continued fractions, Proc. Amer. Math. Soc. 65 (1977), 194-198.
- P. G. Anderson, T. C. Brown, P. J.-S. Shiue, A simple proof of a remarkable continued fraction identity, Proc. Amer. Math. Soc. 123 (1995), 2005-2009.
- D. Bowman, A new generalization of Davison's theorem, Fib. Quart. Volume 26 (1988), 40-45
Crossrefs
Programs
-
Magma
[6^Fibonacci(n): n in [0..11]];
-
Maple
a:= n-> 6^(<<1|1>, <1|0>>^n)[1, 2]: seq(a(n), n=0..12); # Alois P. Heinz, Jun 17 2014
-
Mathematica
RecurrenceTable[{a[0] == 1, a[1] == 6, a[n] == a[n - 1] a[n - 2]}, a[n], {n, 0, 15}]
Formula
a(n) = 6^Fibonacci(n).
Comments