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 A022123 #34 Sep 08 2022 08:44:45
%S A022123 3,11,14,25,39,64,103,167,270,437,707,1144,1851,2995,4846,7841,12687,
%T A022123 20528,33215,53743,86958,140701,227659,368360,596019,964379,1560398,
%U A022123 2524777,4085175,6609952,10695127,17305079,28000206,45305285,73305491,118610776
%N A022123 Fibonacci sequence beginning 3, 11.
%H A022123 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A022123 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1,1).
%F A022123 G.f.: (3+8*x)/(1-x-x^2). - _Philippe Deléham_, Nov 19 2008
%F A022123 a(n) = 8*Fibonacci(n) + 3*Fibonacci(n+1). - _Lechoslaw Ratajczak_, Mar 14 2020
%F A022123 a(n) = a(n-1) + a(n-2). - _Wesley Ivan Hurt_, Jun 17 2021
%t A022123 a={};b=3;c=11;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 A022123 LinearRecurrence[{1,1},{3,11},40] (* _Harvey P. Dale_, Jan 27 2012 *)
%o A022123 (Magma) [8*Fibonacci(n) + 3*Fibonacci(n+1): n in [0..40]]; // _Vincenzo Librandi_, Mar 17 2020
%Y A022123 Cf. A000032, A000045.
%K A022123 nonn,easy
%O A022123 0,1
%A A022123 _N. J. A. Sloane_