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 A022346 #28 Aug 26 2017 20:09:04
%S A022346 0,12,12,24,36,60,96,156,252,408,660,1068,1728,2796,4524,7320,11844,
%T A022346 19164,31008,50172,81180,131352,212532,343884,556416,900300,1456716,
%U A022346 2357016,3813732,6170748,9984480,16155228,26139708,42294936,68434644,110729580,179164224,289893804,469058028,758951832,1228009860
%N A022346 Fibonacci sequence beginning 0, 12.
%D A022346 A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, p. 15.
%H A022346 G. C. Greubel, <a href="/A022346/b022346.txt">Table of n, a(n) for n = 0..1000</a>
%H A022346 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A022346 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1,1).
%F A022346 a(n) = 12*F(n) = F(n+5) + F(n-1) + F(n-3) + F(n-6) for n > 5, where F=A000045.
%F A022346 G.f.: 12*x/(1-x-x^2). - _Philippe Deléham_, Nov 20 2008
%F A022346 a(n) = F(n+6) + F(n-6) - 6*F(n). - _Bruno Berselli_, Dec 29 2016
%t A022346 LinearRecurrence[{1,1},{0,12},40] (* _Harvey P. Dale_, May 07 2016 *)
%o A022346 (PARI) a(n)=12*fibonacci(n) \\ _Charles R Greathouse IV_, Aug 28 2014
%Y A022346 Cf. A000045.
%K A022346 nonn,easy
%O A022346 0,2
%A A022346 _N. J. A. Sloane_