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 A116917 #14 Jul 03 2023 08:16:39
%S A116917 1,1,2,3,5,8,7,9,10,8,7,9,10,8,7,9,10,8,7,9,10,8,7,9,10,8,7,9,10,8,7,
%T A116917 9,10,8,7,9,10,8,7,9,10,8,7,9,10,8,7,9,10,8,7,9,10,8,7,9,10,8,7,9,10,
%U A116917 8,7,9,10,8,7,9,10,8,7,9,10,8,7,9,10,8,7,9,10,8,7,9,10,8,7,9,10,8,7,9,10,8
%N A116917 a(1)=a(2)=1. a(n) = A006530(a(n-1)) + A006530(a(n-2)).
%H A116917 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1, -1, 1).
%F A116917 For n >= 1, a(4n+2) = 8, a(4n+3) = 7, a(4n+4) = 9, a(4n+5) = 10.
%F A116917 From _Chai Wah Wu_, Sep 06 2019: (Start)
%F A116917 a(n) = a(n-1) - a(n-2) + a(n-3) for n > 8.
%F A116917 G.f.: x*(-5*x^7 - x^6 - 4*x^5 - 3*x^4 - x^3 - 2*x^2 - 1)/((x - 1)*(x^2 + 1)). (End)
%F A116917 a(n) = (17+cos(n*Pi/2)+3*sin(n*Pi/2))/2 for n>=6. - _Wesley Ivan Hurt_, May 07 2021
%t A116917 PadRight[{1,1,2,3,5},100,{10,8,7,9}] (* _Harvey P. Dale_, Jun 09 2013 *)
%Y A116917 Cf. A006530.
%K A116917 easy,nonn
%O A116917 1,3
%A A116917 _Leroy Quet_, Feb 26 2006