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 A022372 #17 Aug 27 2017 17:46:00
%S A022372 2,20,22,42,64,106,170,276,446,722,1168,1890,3058,4948,8006,12954,
%T A022372 20960,33914,54874,88788,143662,232450,376112,608562,984674,1593236,
%U A022372 2577910,4171146,6749056,10920202
%N A022372 Fibonacci sequence beginning 2, 20.
%H A022372 G. C. Greubel, <a href="/A022372/b022372.txt">Table of n, a(n) for n = 0..1000</a>
%H A022372 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A022372 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1, 1).
%F A022372 G.f.: (2+18*x)/(1-x-x^2). - _Philippe Deléham_, Nov 19 2008
%F A022372 a(n) = 2*(Fibonacci(n+2) + 8*Fibonacci(n)). - _G. C. Greubel_, Aug 27 2017
%F A022372 a(n) = 2*A022100(n). - _Alois P. Heinz_, Aug 27 2017
%t A022372 a={};b=2;c=20;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 A022372 Table[2*(Fibonacci[n + 2] + 8*Fibonacci[n]), {n,0,50}] (* or *) LinearRecurrence[{1,1}, {2,20}, 50] (* _G. C. Greubel_, Aug 27 2017 *)
%o A022372 (PARI) for(n=0,50, print1(2*(fibonacci(n+2) + 8*fibonacci(n)), ", ")) \\ _G. C. Greubel_, Aug 27 2017
%Y A022372 Cf. A022100.
%K A022372 nonn
%O A022372 0,1
%A A022372 _N. J. A. Sloane_