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 A022354 #17 Aug 26 2017 18:17:55
%S A022354 0,20,20,40,60,100,160,260,420,680,1100,1780,2880,4660,7540,12200,
%T A022354 19740,31940,51680,83620,135300,218920,354220,573140,927360,1500500,
%U A022354 2427860,3928360,6356220,10284580
%N A022354 Fibonacci sequence beginning 0, 20.
%H A022354 G. C. Greubel, <a href="/A022354/b022354.txt">Table of n, a(n) for n = 0..1000</a>
%H A022354 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A022354 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1, 1).
%F A022354 G.f.: 20*x/(1-x-x^2). - _Philippe Deléham_, Nov 20 2008
%F A022354 a(n) = 20*A000045(n). - _G. C. Greubel_, Aug 26 2017
%t A022354 a={};b=0;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 17 2008 *)
%t A022354 Table[20*Fibonacci[n], {n,0,50}] (* or *) LinearRecurrence[{1,1}, {0,20}, 50] (* _G. C. Greubel_, Aug 26 2017 *)
%o A022354 (PARI) for(n=0,50, print1(20*fibonacci(n), ", ")) \\ _G. C. Greubel_, Aug 26 2017
%K A022354 nonn
%O A022354 0,2
%A A022354 _N. J. A. Sloane_