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 A022401 #34 Feb 18 2024 02:02:08
%S A022401 1,31,32,63,95,158,253,411,664,1075,1739,2814,4553,7367,11920,19287,
%T A022401 31207,50494,81701,132195,213896,346091,559987,906078,1466065,2372143,
%U A022401 3838208,6210351,10048559,16258910
%N A022401 Fibonacci sequence beginning 1, 31.
%H A022401 Vincenzo Librandi, <a href="/A022401/b022401.txt">Table of n, a(n) for n = 0..1000</a>
%H A022401 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A022401 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1, 1).
%F A022401 a(n) = A118654(5, n).
%F A022401 G.f.: (1+30*x)/(1-x-x^2). - _Philippe Deléham_, Nov 20 2008
%F A022401 a(n) = (2^(-1-n)*((1-sqrt(5))^n*(-61+sqrt(5)) + (1+sqrt(5))^n*(61+sqrt(5)))) / sqrt(5). - _Colin Barker_, Mar 02 2018
%t A022401 CoefficientList[Series[(1 + 30 x)/(1 - x - x^2), {x, 0, 40}], x] (* _Vincenzo Librandi_, Oct 30 2014 *)
%t A022401 Table[Fibonacci[n + 2] + 29*Fibonacci[n], {n, 0, 50}] (* _G. C. Greubel_, Mar 01 2018 *)
%o A022401 (Magma) I:=[1, 31]; [n le 2 select I[n] else Self(n-1)+Self(n-2): n in [1..40]]; // _Vincenzo Librandi_, Oct 30 2014
%o A022401 (PARI) for(n=0, 40, print1(fibonacci(n+2) + 29*fibonacci(n), ", ")) \\ _G. C. Greubel_, Mar 01 2018
%K A022401 nonn
%O A022401 0,2
%A A022401 _N. J. A. Sloane_