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 A251765 #16 Feb 27 2023 08:38:47
%S A251765 0,0,1,0,0,0,0,0,0,0,1,2,4,7,14,28,56,112,224,448,896,1791,3580,7156,
%T A251765 14305,28596,57164,114272,228432,456640,912832,1824768,3647745,
%U A251765 7291910,14576664,29139023,58249450,116441736,232769200,465309968,930163296,1859413760
%N A251765 10-step Fibonacci sequence starting with 0,0,1,0,0,0,0,0,0,0.
%H A251765 <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,1,1,1,1,1,1,1,1).
%F A251765 a(n+10) = a(n)+a(n+1)+a(n+2)+a(n+3)+a(n+4)+a(n+5)+a(n+6)+a(n+7)+a(n+8) +a(n+9).
%F A251765 G.f.: x^2*(-1 +x +x^2 +x^3 +x^4 +x^5 +x^6+ x^7)/(-1+x +x^2 +x^3 +x^4 +x^5 +x^6 +x^7 +x^8 +x^9 +x^10) . - _R. J. Mathar_, Feb 27 2023
%t A251765 LinearRecurrence[Table[1, {10}], {0, 0, 1, 0, 0, 0, 0, 0, 0, 0}, 45] (* _Michael De Vlieger_, Dec 09 2014 *)
%Y A251765 Other 10-step Fibonacci sequences are A251759, A251760, A251761, A251762, A251763, A251764, A251766.
%K A251765 nonn,easy
%O A251765 0,12
%A A251765 _Arie Bos_, Dec 07 2014