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 A022139 #32 Mar 02 2022 09:15:56
%S A022139 5,14,19,33,52,85,137,222,359,581,940,1521,2461,3982,6443,10425,16868,
%T A022139 27293,44161,71454,115615,187069,302684,489753,792437,1282190,2074627,
%U A022139 3356817,5431444,8788261,14219705,23007966,37227671,60235637,97463308,157698945
%N A022139 Fibonacci sequence beginning 5, 14.
%H A022139 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A022139 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1,1).
%F A022139 G.f.: (5+9x)/(1-x-x^2). - _Philippe Deléham_, Nov 20 2008
%F A022139 a(0)=5, a(1)=14, a(n)=a(n-1)+a(n-2). - _Harvey P. Dale_, Apr 15 2015
%F A022139 a(n) = Fibonacci(n+6) - Lucas(n-2). - _Greg Dresden_ and Tyler Zidlicky, Mar 01 2022
%t A022139 Transpose[NestList[{#[[2]],#[[1]]+#[[2]]}&,{5,14},30]][[1]] (* _Harvey P. Dale_, Feb 07 2011 *)
%t A022139 LinearRecurrence[{1,1},{5,14},40](* _Harvey P. Dale_, Apr 15 2015 *)
%Y A022139 Cf. A000032, A000045.
%K A022139 nonn,easy
%O A022139 0,1
%A A022139 _N. J. A. Sloane_