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 A022352 #25 Aug 26 2017 18:15:12
%S A022352 0,18,18,36,54,90,144,234,378,612,990,1602,2592,4194,6786,10980,17766,
%T A022352 28746,46512,75258,121770,197028,318798,515826,834624,1350450,2185074,
%U A022352 3535524,5720598,9256122,14976720
%N A022352 Fibonacci sequence beginning 0, 18.
%H A022352 G. C. Greubel, <a href="/A022352/b022352.txt">Table of n, a(n) for n = 0..1000</a>
%H A022352 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A022352 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1, 1).
%F A022352 G.f.: 18*x/(1-x-x^2). - _Philippe Deléham_, Nov 20 2008
%F A022352 a(n) = 9*(Lucas(n) - Fibonacci(n)). - _Harvey P. Dale_, Oct 09 2013
%t A022352 a={};b=0;c=18;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 A022352 LinearRecurrence[{1,1},{0,18},40] (* or *) Table[9(LucasL[n]- Fibonacci[n]),{n,40}] (* _Harvey P. Dale_, Oct 09 2013 *)
%o A022352 (PARI) for(n=0,50, print1(18*fibonacci(n), ", ")) \\ _G. C. Greubel_, Aug 26 2017
%Y A022352 Cf. A258160.
%Y A022352 Cf. sequences with formula Fibonacci(n+k)+Fibonacci(n-k) listed in A280154.
%K A022352 nonn,easy
%O A022352 0,2
%A A022352 _N. J. A. Sloane_