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 A022125 #26 Mar 01 2022 01:46:07
%S A022125 3,14,17,31,48,79,127,206,333,539,872,1411,2283,3694,5977,9671,15648,
%T A022125 25319,40967,66286,107253,173539,280792,454331,735123,1189454,1924577,
%U A022125 3114031,5038608,8152639,13191247,21343886,34535133,55879019,90414152,146293171,236707323
%N A022125 Fibonacci sequence beginning 3, 14.
%H A022125 Colin Barker, <a href="/A022125/b022125.txt">Table of n, a(n) for n = 0..1000</a>
%H A022125 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A022125 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1, 1).
%F A022125 G.f.: (3 + 11*x)/(1 - x - x^2). - _Philippe Deléham_, Nov 19 2008
%F A022125 a(n) = h*Fibonacci(n+k) + Fibonacci(n+k-h) with h=6, k=2. - _Bruno Berselli_, Feb 20 2017
%F A022125 From _Colin Barker_, Feb 20 2017: (Start)
%F A022125 a(n) = (2^(-1-n)*((1-sqrt(5))^n*(-25+3*sqrt(5)) + (1+sqrt(5))^n*(25+3*sqrt(5)))) / sqrt(5).
%F A022125 a(n) = a(n-1) + a(n-2) for n>1.
%F A022125 (End)
%F A022125 a(n) = Lucas(n+4) + Lucas(n-3). - _Greg Dresden_ and Kathleen Wilson, Feb 28 2022
%t A022125 LinearRecurrence[{1, 1}, {3, 14}, 40] (* _Harvey P. Dale_, Oct 24 2013 *)
%o A022125 (PARI) Vec((3 + 11*x) / (1 - x - x^2) + O(x^50)) \\ _Colin Barker_, Feb 20 2017
%Y A022125 Cf. A000032, A000045.
%K A022125 nonn,easy
%O A022125 0,1
%A A022125 _N. J. A. Sloane_