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 A022379 #39 Sep 08 2022 08:44:46
%S A022379 3,9,12,21,33,54,87,141,228,369,597,966,1563,2529,4092,6621,10713,
%T A022379 17334,28047,45381,73428,118809,192237,311046,503283,814329,1317612,
%U A022379 2131941,3449553,5581494,9031047,14612541,23643588,38256129,61899717,100155846,162055563,262211409
%N A022379 Fibonacci sequence beginning 3, 9.
%H A022379 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A022379 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1, 1).
%F A022379 G.f.: (3 + 6*x)/(1 - x - x^2). - _Philippe Deléham_, Nov 19 2008
%F A022379 a(n+2) = 3*L(n+3) = L(n) + 4*L(n+1) + 2*L(n+2), where L=A000032. - _J. M. Bergot_, Oct 21 2012
%F A022379 a(n) = Fibonacci(n+4) - Fibonacci(n-4), where n>0 and Fibonacci(-3..-1) = 2,-1,1. - _Bruno Berselli_, May 22 2015
%F A022379 a(n) = L(n+4) + L(n-4) - 4*L(n) for n>0. - _Bruno Berselli_, Dec 29 2016
%t A022379 LinearRecurrence[{1, 1}, {3, 9}, 30] (* _Alonso del Arte_, Oct 09 2013 *)
%t A022379 Table[3 LucasL[n + 1], {n, 0, 40}] (* _Bruno Berselli_, May 22 2015 *)
%t A022379 Table[LucasL[n + 4] + LucasL[n - 4] - 4 LucasL[n], {n, 1, 40}] (* _Bruno Berselli_, Dec 30 2016 *)
%o A022379 (PARI) Vec((3+6*x)/(1-x-x^2)+O(x^99)) \\ _Charles R Greathouse IV_, Oct 21 2012
%o A022379 (Magma) [3*Lucas(n+1): n in [0..40]]; // _Bruno Berselli_, May 22 2015
%Y A022379 Cf. A000032, A000045.
%Y A022379 Cf. similar sequences listed in A258160.
%K A022379 nonn,easy
%O A022379 0,1
%A A022379 _N. J. A. Sloane_
%E A022379 More terms from _Bruno Berselli_, May 22 2015