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 A098127 #16 Aug 17 2017 03:00:04
%S A098127 7,26,33,59,92,151,243,394,637,1031,1668,2699,4367,7066,11433,18499,
%T A098127 29932,48431,78363,126794,205157,331951,537108,869059,1406167,2275226,
%U A098127 3681393,5956619,9638012,15594631,25232643,40827274,66059917,106887191,172947108
%N A098127 Fibonacci sequence with a(1) = 7 and a(2) = 26.
%H A098127 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A098127 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1, 1).
%F A098127 a(n) = a(n-1) + a(n-2).
%F A098127 G.f.: (7x + 19x^2)/(1 - x - x^2). - _Emeric Deutsch_, Apr 16 2005
%e A098127 a(3) = a(2) + a(1) = 26 + 7 = 33.
%p A098127 a[1]:=7:a[2]:=26: for n from 3 to 37 do a[n]:=a[n-1]+a[n-2] od: seq(a[n],n=1..37); # _Emeric Deutsch_, Apr 16 2005
%t A098127 LinearRecurrence[{1, 1}, {7, 26}, 80] (* _Vladimir Joseph Stephan Orlovsky_, Feb 17 2012 *)
%Y A098127 Cf. A022136, A097657.
%K A098127 nonn
%O A098127 1,1
%A A098127 _Parthasarathy Nambi_, Sep 26 2004
%E A098127 More terms from _Emeric Deutsch_, Apr 16 2005