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 A103378 #43 Sep 01 2024 02:37:37
%S A103378 1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,2,2,3,4,4,4,4,4,4,4,4,4,5,7,8,
%T A103378 8,8,8,8,8,8,8,9,12,15,16,16,16,16,16,16,16,17,21,27,31,32,32,32,32,
%U A103378 32,32,33,38,48,58,63,64,64,64,64,64,65,71,86,106,121,127,128
%N A103378 a(n) = a(n-10) + a(n-11) for n > 11, and a(n) = 1 for 1 <= n <= 11.
%H A103378 <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,0,0,0,1,1).
%F A103378 G.f.: x*(1+x+x^2+x^3+x^4+x^5+x^6+x^7+x^8+x^9)/(1-x^10-x^11). - _R. J. Mathar_, Nov 22 2007
%e A103378 a(52)=17 because a(52)=a(52-10)+a(52-11) = a(42)+a(41) = 9 + 8.
%p A103378 A103378 := proc(n) option remember; if n <= 11 then 1 ; else A103378(n-10)+A103378(n-11) ; fi ; end: seq(A103378(n),n=1..78) ; # _R. J. Mathar_, Nov 22 2007
%t A103378 k=10; Do[a[n]=1, {n, k+1}]; a[n_]:=a[n]=a[n-k]+a[n-k-1]; A103377=Array[a, 100] N[Solve[x^10 - x - 1 == 0, x], 111][[2]]
%t A103378 LinearRecurrence[Join[Table[0,{9}],{1,1}],Table[1,{11}],80] (* _Harvey P. Dale_, Aug 14 2013 *)
%o A103378 (PARI) Vec((x^10-1)/(x-1)/(1-x^10-x^11)+O(x^80)) \\ _M. F. Hasler_, Sep 19 2015
%Y A103378 Cf. A079398, A103372-A103377, A103379-A103380, A103388, A103398.
%K A103378 easy,nonn
%O A103378 1,12
%A A103378 _Jonathan Vos Post_, Feb 15 2005
%E A103378 Corrected and extended by _R. J. Mathar_, Nov 22 2007
%E A103378 Edited by _M. F. Hasler_, Sep 19 2015