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 A034478 #61 Dec 10 2023 15:18:20
%S A034478 1,3,13,63,313,1563,7813,39063,195313,976563,4882813,24414063,
%T A034478 122070313,610351563,3051757813,15258789063,76293945313,381469726563,
%U A034478 1907348632813,9536743164063,47683715820313,238418579101563
%N A034478 a(n) = (5^n + 1)/2.
%C A034478 Terms (with the offset changed to 1) are also the quotients arising from sequence A050621.
%C A034478 Partial sums of A020699. - _Paul Barry_, Sep 03 2003
%C A034478 Binomial transform of A081294. - _Paul Barry_, Jan 13 2005
%H A034478 Nathaniel Johnston, <a href="/A034478/b034478.txt">Table of n, a(n) for n = 0..250</a>
%H A034478 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (6,-5).
%F A034478 E.g.f.: exp(3*x)*cosh(2*x). - _Paul Barry_, Mar 17 2003
%F A034478 G.f.: (1-3*x)/((1-x)*(1-5*x)). - _Paul Barry_, Sep 03 2003
%F A034478 a(n) = Sum_{k=0..n} Sum_{j=0..k} binomial(n, k)*binomial(2*k, 2*j). - _Paul Barry_, Jan 13 2005
%F A034478 a(n) = 6*a(n-1) - 5*a(n-2) for n>1, a(0)=1, a(1)=3. - _Philippe Deléham_, Jul 11 2005
%F A034478 a(n)^2 + (a(n) - 1)^2 = a(2*n). E.g., 63^2 + 62^2 = 7813 = a(6). - _Gary W. Adamson_, Jun 17 2006
%F A034478 a(n) = 5*a(n-1) - 2 for n>0, a(0)=1. - _Vincenzo Librandi_, Aug 01 2010
%F A034478 a(n) = A034474(n)/2. - _Elmo R. Oliveira_, Dec 10 2023
%e A034478 G.f. = 1 + 3*x + 13*x^2 + 63*x^3 + 313*x^4 + 1563*x^5 + 7813*x^6 + ...
%p A034478 seq((5^n + 1)/2, n=0..20); # _Zerinvary Lajos_, Jun 16 2007
%t A034478 LinearRecurrence[{6, -5},{1, 3},22] (* _Ray Chandler_, May 25 2021 *)
%o A034478 (Sage) [lucas_number2(n,6,5)/2 for n in range(0,22)] # _Zerinvary Lajos_, Jul 08 2008
%Y A034478 Cf. A020699, A034474, A050621, A081294.
%K A034478 nonn,easy
%O A034478 0,2
%A A034478 _N. J. A. Sloane_