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.
%I A110113 #18 Dec 26 2019 04:46:22
%S A110113 0,1,2,3,5,9,17,34,71,154,346,802,1914,4693,11800,30379,79963,214925,
%T A110113 589223,1645994,4681037,13541446,39817560,118925810,360577616,
%U A110113 1109158545,3459636358,10936941299,35026082521,113588037953
%N A110113 Diagonal sums of A083856.
%C A110113 Sums of antidiagonals of A083856.
%H A110113 A. G. Shannon and J. V. Leyendekkers, <a href="http://nntdm.net/volume-21-2015/number-2/35-42/">The Golden Ratio family and the Binet equation</a>, Notes on Number Theory and Discrete Mathematics, 21(2) (2015), 35-42.
%F A110113 a(n) = Sum_{k = 0..n} ((1 + sqrt(4*(n - k) + 1))/2)^k / sqrt(4*(n - k) + 1) - ((1 -sqrt(4*(n - k) + 1))/2)^k / sqrt(4*(n - k) + 1). [Corrected by _Petros Hadjicostas_, Dec 26 2019]
%p A110113 T := proc(n, k) local v; option remember; if 0 <= n and k = 0 then v := 0; end if; if 0 <= n and k = 1 then v := 1; end if; if 0 <= n and 2 <= k then v := T(n, k - 1) + n*T(n, k - 2); end if; v; end proc;
%p A110113 a := proc(n) local k; add(T(n - k, k), k = 0 .. n); end proc;
%p A110113 seq(a(n), n = 0..40); # _Petros Hadjicostas_, Dec 26 2019
%K A110113 easy,nonn
%O A110113 0,3
%A A110113 _Paul Barry_, Jul 12 2005