cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A096656 a(n) = F(n+2)*a(n-1) + F(n+1)*a(n-2), where F = A000045 (Fibonacci numbers), a(0)=1, a(1)=2.

This page as a plain text file.
%I A096656 #7 Nov 27 2015 05:35:23
%S A096656 1,2,8,46,408,5672,124416,4349256,243439224,21905300016,3176029293240,
%T A096656 743169188527224,280914798900088368,171638202113128667928,
%U A096656 169578263512987049149416,270985893735725975486862288
%N A096656 a(n) = F(n+2)*a(n-1) + F(n+1)*a(n-2), where F = A000045 (Fibonacci numbers), a(0)=1, a(1)=2.
%C A096656 This is the sequence of denominators of self-convergents to the number 1.389805... whose self-continued fraction is (1,2,3,5,8,...) (Fibonacci numbers). See A096655 for numerators and A096654 for definitions.
%F A096656 a(n) ~ c * ((1+sqrt(5))/2)^((n+2)*(n+3)/2) / 5^(n/2) where c = 0.5018252861856573838264566231631563920610293670131098212588... . - _Vaclav Kotesovec_, Nov 27 2015
%e A096656 a(2)=F(4)*2+F(3)*1=8, a(3)=F(5)*8+F(4)*2=46.
%t A096656 a[0] = 1; a[1] = 2; a[n_] := Fibonacci[n + 2]*a[n - 1] + Fibonacci[n + 1]*a[n - 2]; Table[ a[n], {n, 0, 16}] (* _Robert G. Wilson v_, Jul 09 2004 *)
%Y A096656 Cf. A000045, A096654, A096655.
%K A096656 nonn
%O A096656 0,2
%A A096656 _Clark Kimberling_, Jul 01 2004
%E A096656 More terms from _Robert G. Wilson v_, Jul 09 2004