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 A251760 #21 Mar 28 2025 11:07:21
%S A251760 0,0,0,0,0,0,0,1,0,0,1,2,4,8,16,32,64,128,255,510,1020,2039,4076,8148,
%T A251760 16288,32560,65088,130112,260096,519937,1039364,2077708,4153377,
%U A251760 8302678,16597208,33178128,66323696,132582304,265034496,529808896,1059097855,2117156346
%N A251760 10-step Fibonacci sequence starting with 0,0,0,0,0,0,0,1,0,0.
%H A251760 <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 A251760 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 A251760 G.f.: x^7*(-1+x+x^2)/(-1+x+x^2+x^3+x^4+x^5+x^6+x^7+x^8+x^9+x^10) . - _R. J. Mathar_, Mar 28 2025
%F A251760 a(n) = A122265(n+2)-A122265(n+1)-A122265(n). - _R. J. Mathar_, Mar 28 2025
%t A251760 LinearRecurrence[Table[1, {10}], {0, 0, 0, 0, 0, 0, 0, 1, 0, 0}, 45] (* _Michael De Vlieger_, Dec 08 2014 *)
%Y A251760 Other 10-step Fibonacci sequences are A251759, A251761, A251762, A251763, A251764, A251765, A251766.
%K A251760 nonn,easy
%O A251760 0,12
%A A251760 _Arie Bos_, Dec 07 2014