(2 + phi)/a(n) is the sum of successive remainders when computing the Euclidean algorithm for (1, A088166(n)/phi) with phi being the golden ratio, where n >= 2.
A087954
(2 + phi)/a(n) is the sum of successive remainders when computing the Euclidean algorithm for (1, A088166(n)/phi) with phi being the golden ratio, where n >= 2.
Terms
- a(0) =40a(1) =320a(2) =2160a(3) =15004a(4) =103680a(5) =709804a(6) =4868640a(7) =33385280a(8) =228811000a(9) =1568358004a(10) =10749957120a(11) =73681030804a(12) =505018447960
External references
- oeis: A087954