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 A022324 #13 Nov 04 2019 13:59:54
%S A022324 1,10,12,23,36,60,97,158,256,415,672,1088,1761,2850,4612,7463,12076,
%T A022324 19540,31617,51158,82776,133935,216712,350648,567361,918010,1485372,
%U A022324 2403383,3888756,6292140,10180897
%N A022324 a(n) = a(n-1) + a(n-2) + 1, with a(0) = 1 and a(1) = 10.
%H A022324 G. C. Greubel, <a href="/A022324/b022324.txt">Table of n, a(n) for n = 0..1000</a>
%H A022324 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (2,0,-1).
%F A022324 From _R. J. Mathar_, Apr 07 2011: (Start)
%F A022324 G.f.: (1+8*x-8*x^2)/((1-x)*(1-x-x^2)).
%F A022324 a(n) = A022115(n) - 1. (End)
%F A022324 a(n) = 2*F(n+2) + 7*F(n) - 1, where F = A000045. - _G. C. Greubel_, Aug 25 2017
%t A022324 LinearRecurrence[{2,0,-1}, {1,10,12}, 50] (* _G. C. Greubel_, Aug 25 2017 *)
%t A022324 RecurrenceTable[{a[0]==1,a[1]==10,a[n]==a[n-1]+a[n-2]+1},a,{n,30}] (* _Harvey P. Dale_, Nov 04 2019 *)
%o A022324 (PARI) x='x+O('x^50); vec((1+8*x-8*x^2)/((1-x)*(1-x-x^2))) \\ _G. C. Greubel_, Aug 25 2017
%K A022324 nonn
%O A022324 0,2
%A A022324 _N. J. A. Sloane_