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 A180158 #12 Mar 30 2024 23:08:45 %S A180158 1,1,0,1,2,2,3,5,7,9,13,20,28,39,57,82,116,166,239,342,488,699,1002, %T A180158 1433,2050,2936,4203,6014,8608,12323,17638,25244,36134,51722,74030, %U A180158 105961,151669,217091,310729,444760,636607,911202,1304240,1866817,2672058,3824629 %N A180158 Number of ways are there to score a break of n points at snooker. Assuming an infinite number of reds are available, along with the usual six colors, and a break alternates red-color-red-... %C A180158 Equivalently, a(n) is the number of compositions of n with odd-indexed parts being 1 and even-indexed parts being between 2 and 7. - _Andrew Howroyd_, Jan 14 2020 %H A180158 Andrew Howroyd, <a href="/A180158/b180158.txt">Table of n, a(n) for n = 0..1000</a> %H A180158 <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,1,1,1,1,1,1). %F A180158 a(n) = a(n-3) + a(n-4) + a(n-5) + a(n-6) + a(n-7) + a(n-8) for n >= 8. %F A180158 G.f.: (1 + x)/(1 - x^3 - x^4 - x^5 - x^6 - x^7 - x^8). - _Andrew Howroyd_, Jan 14 2020 %e A180158 For n=0 there is one way to score zero points - pot nothing, potting a single red is the one way to have a break of one, a break of two is impossible (as defined here), a break of three can only be achieved with a red followed by a yellow, ... %o A180158 (PARI) Vec((1 + x)/(1 - x^3 - x^4 - x^5 - x^6 - x^7 - x^8) + O(x^50)) \\ _Andrew Howroyd_, Jan 14 2020 %K A180158 nonn,easy %O A180158 0,5 %A A180158 Rob Cummings (robc(AT)rocoto.demon.co.uk), Aug 14 2010