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 A022389 #33 Sep 08 2022 08:44:46
%S A022389 7,15,22,37,59,96,155,251,406,657,1063,1720,2783,4503,7286,11789,
%T A022389 19075,30864,49939,80803,130742,211545,342287,553832,896119,1449951,
%U A022389 2346070,3796021,6142091,9938112,16080203,26018315,42098518,68116833,110215351,178332184
%N A022389 Fibonacci sequence beginning 7, 15.
%H A022389 Harvey P. Dale, <a href="/A022389/b022389.txt">Table of n, a(n) for n = 0..1000</a>
%H A022389 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A022389 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1, 1).
%F A022389 G.f.: (7+8*x)/(1-x-x^2). - _Philippe Deléham_, Nov 20 2008
%F A022389 a(n) = 7*Fibonacci(n+2) + Fibonacci(n) = 7*Fibonacci(n-1) + 15*Fibonacci(n). - _G. C. Greubel_, Mar 02 2018
%F A022389 a(n) = Fibonacci(n+6) + Lucas(n-1). - _Greg Dresden_ and Russ Zimmerman, Mar 03 2022
%p A022389 with(combinat,fibonacci): seq(7*fibonacci(n+2)+fibonacci(n),n=0..35); # _Muniru A Asiru_, Mar 03 2018
%t A022389 LinearRecurrence[{1,1},{7,15},40] (* _Harvey P. Dale_, Aug 27 2013 *)
%t A022389 Table[7*Fibonacci[n+2] + Fibonacci[n], {n, 0, 50}] (* _G. C. Greubel_, Mar 02 2018 *)
%o A022389 (PARI) for(n=0, 50, print1(7*fibonacci(n+2) + fibonacci(n), ", ")) \\ _G. C. Greubel_, Mar 02 2018
%o A022389 (Magma) [7*Fibonacci(n+2) + Fibonacci(n): n in [0..50]]; // _G. C. Greubel_, Mar 02 2018
%o A022389 (GAP) List([0..35],n->7*Fibonacci(n+2)+Fibonacci(n)); # _Muniru A Asiru_, Mar 03 2018
%Y A022389 Cf. A000032.
%K A022389 nonn,easy
%O A022389 0,1
%A A022389 _N. J. A. Sloane_