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 A206608 #29 Jun 05 2024 12:10:34
%S A206608 13,10,23,33,56,89,145,234,379,613,992,1605,2597,4202,6799,11001,
%T A206608 17800,28801,46601,75402,122003,197405,319408,516813,836221,1353034,
%U A206608 2189255,3542289,5731544,9273833,15005377,24279210,39284587,63563797,102848384,166412181
%N A206608 Fibonacci sequence beginning 13, 10.
%H A206608 Vincenzo Librandi, <a href="/A206608/b206608.txt">Table of n, a(n) for n = 1..1000</a>
%H A206608 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (1,1).
%F A206608 a(n) = Fibonacci(n+5) + Fibonacci(n-6). - _Greg Dresden_ and Gavron Campbell, Mar 03 2022
%t A206608 LinearRecurrence[{1, 1}, {13, 10}, 80]
%o A206608 (Magma) I:=[13, 10]; [n le 2 select I[n] else Self(n-1)+ Self(n-2): n in [1..40]]; // _Vincenzo Librandi_, Feb 16 2012
%Y A206608 Cf. A000032, A000045, A206607.
%K A206608 nonn,easy
%O A206608 1,1
%A A206608 _Vladimir Joseph Stephan Orlovsky_, Feb 10 2012