|
Search: id:A101361
|
|
|
| A101361 |
|
a(1) = a(2) = 1; for n > 2, a(n) = Knuth's Fibonacci (or circle) product "a(n-1) o a(n-1)". |
|
+0
1
|
|
| 1, 1, 3, 8, 55, 987, 121393, 267914296, 72723460248141, 43566776258854844738105, 7084593923980518516849609894969925639, 690168906931029935139391829792095612517948949963798093315456
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
D. E. Knuth, Fibonacci multiplication, Appl. Math. Lett. 1 (1988), 57-60.
|
|
FORMULA
|
a(n) = Fib(2*Fib(n)).
|
|
EXAMPLE
|
1o1 = 3, 1o3 = 8, 3o8 = 55, ...
|
|
MAPLE
|
with(combinat); f:=n->fibonacci(2*fibonacci(n));
|
|
MATHEMATICA
|
Table[ Fibonacci[2Fibonacci[n]], {n, 12}] (from Robert G. Wilson v Feb 12 2005)
|
|
PROGRAM
|
(PARI) a(n)=if(n<1, 0, fibonacci(2*fibonacci(n)))
|
|
CROSSREFS
|
Cf. A101330.
Adjacent sequences: A101358 A101359 A101360 this_sequence A101362 A101363 A101364
Sequence in context: A019035 A026088 A121567 this_sequence A104034 A000825 A132517
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas, Jan 26 2005
|
|
EXTENSIONS
|
Formula and more terms from Michael Somos, Feb 03, 2005.
|
|
|
Search completed in 0.002 seconds
|
