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 A087953 #16 Jun 03 2021 11:43:21
%S A087953 1,1,3,7,17,45,117,305,799,2091,5473,14329,37513,98209,257115,673135,
%T A087953 1762289,4613733,12078909,31622993,82790071,216747219,567451585,
%U A087953 1485607537,3889371025,10182505537,26658145587,69791931223,182717648081,478361013021,1252365390981
%N A087953 a(n) = floor((Fibonacci(2*n+1)+1)/2).
%H A087953 Harvey P. Dale, <a href="/A087953/b087953.txt">Table of n, a(n) for n = 0..1000</a>
%H A087953 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (3,-1,1,-3,1).
%F A087953 G.f.: (-1-x^4+2*x^3-x^2+2*x)/((x-1)*(x^2+x+1)*(x^2-3*x+1)). [Maksym Voznyy (voznyy(AT)mail.ru), Jul 27 2009]
%t A087953 Table[Floor[(Fibonacci[2n+1]+1)/2],{n,0,30}] (* _Harvey P. Dale_, May 31 2021 *)
%Y A087953 Cf. A000045, A032908.
%K A087953 nonn,easy
%O A087953 0,3
%A A087953 _Thomas Baruchel_, Sep 23 2003