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 A384153 #12 May 26 2025 20:05:43 %S A384153 0,1,2,4,9,20,43,91,191,398,824,1697,3480,7111,14487,29439,59694, %T A384153 120820,244153,492716,993171,1999923,4023679,8089182,16251760, %U A384153 32632321,65490672,131377999,263452079,528125695,1058395038,2120551916,4247705401,8506995748,17034321659 %N A384153 a(n) is the number of binary strings of length n whose shortest run of 1s is of length 1. %H A384153 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-5,3,-2). %F A384153 G.f.: 1/(1-2*x) - (1-x)/(x*(1-2*x+x^2-x^3)). %Y A384153 Cf. A000071, A384154. %K A384153 nonn,easy %O A384153 0,3 %A A384153 _Félix Balado_, May 20 2025