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 A022366 #21 Aug 26 2017 20:10:29
%S A022366 0,32,32,64,96,160,256,416,672,1088,1760,2848,4608,7456,12064,19520,
%T A022366 31584,51104,82688,133792,216480,350272,566752,917024,1483776,2400800,
%U A022366 3884576,6285376,10169952,16455328
%N A022366 Fibonacci sequence beginning 0, 32.
%H A022366 G. C. Greubel, <a href="/A022366/b022366.txt">Table of n, a(n) for n = 0..1000</a>
%H A022366 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A022366 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1,1)
%F A022366 a(n) = 32*A000045(n).
%F A022366 G.f.: 32*x/(1-x-x^2). - _Philippe Deléham_, Nov 20 2008
%t A022366 a={};b=0;c=32;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 A022366 LinearRecurrence[{1,1},{0,32},30] (* _Harvey P. Dale_, Apr 07 2012 *)
%o A022366 (PARI) for(n=0,50, print1(32*fibonacci(n), ", ")) \\ _G. C. Greubel_, Aug 26 2017
%K A022366 nonn
%O A022366 0,2
%A A022366 _N. J. A. Sloane_