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 A022122 #42 Jun 20 2022 08:35:32
%S A022122 3,10,13,23,36,59,95,154,249,403,652,1055,1707,2762,4469,7231,11700,
%T A022122 18931,30631,49562,80193,129755,209948,339703,549651,889354,1439005,
%U A022122 2328359,3767364,6095723,9863087,15958810,25821897,41780707,67602604,109383311,176985915
%N A022122 Fibonacci sequence beginning 3, 10.
%H A022122 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A022122 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1,1).
%F A022122 G.f.: (3+7x)/(1-x-x^2). - _Philippe Deléham_, Nov 19 2008
%F A022122 From _Wajdi Maaloul_, Jun 09 2022: (Start)
%F A022122 a(n) = 3*Lucas(n+1) + Fibonacci(n).
%F A022122 a(n) = 3*Fibonacci(n+1) + 7*Fibonacci(n).
%F A022122 a(n) = a(n-1) + a(n-2). (End)
%t A022122 a={};b=3;c=10;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 *)
%Y A022122 Cf. A000032, A000045.
%K A022122 nonn,easy
%O A022122 0,1
%A A022122 _N. J. A. Sloane_