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 A022370 #20 Aug 27 2017 18:29:33
%S A022370 2,16,18,34,52,86,138,224,362,586,948,1534,2482,4016,6498,10514,17012,
%T A022370 27526,44538,72064,116602,188666,305268,493934,799202,1293136,2092338,
%U A022370 3385474,5477812,8863286,14341098
%N A022370 Fibonacci sequence beginning 2, 16.
%H A022370 G. C. Greubel, <a href="/A022370/b022370.txt">Table of n, a(n) for n = 0..1000</a>
%H A022370 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A022370 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1, 1).
%F A022370 G.f.: (2+14*x)/(1-x-x^2). - _Philippe Deléham_, Nov 19 2008
%F A022370 a(n) = 2*(Fibonacci(n+2) + 6*Fibonacci(n)). - _G. C. Greubel_, Aug 27 2017
%F A022370 a(n) = 2 * A022098(n). - _Alois P. Heinz_, Aug 27 2017
%t A022370 a={};b=2;c=16;AppendTo[a, b];AppendTo[a, c];Do[b=b+c;AppendTo[a, b];c=b+c;AppendTo[a, c], {n, 4!}];a (* _Vladimir Joseph Stephan Orlovsky_, Sep 18 2008 *)
%t A022370 LinearRecurrence[{1,1},{2,16},40] (* _Harvey P. Dale_, Aug 11 2011 *)
%o A022370 (PARI) for(n=0,50, print1(2*(fibonacci(n+2) + 6*fibonacci(n)), ", ")) \\ _G. C. Greubel_, Aug 27 2017
%Y A022370 Cf. A022098.
%K A022370 nonn
%O A022370 0,1
%A A022370 _N. J. A. Sloane_