login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A180158 How many 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-... 0
1, 1, 0, 1, 2, 2, 3, 5, 7, 9, 13, 20, 28, 39, 57, 82, 116, 166, 239, 342, 488, 699, 1002, 1433, 2050, 2936, 4203, 6014, 8608 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,5

LINKS

Table of n, a(n) for n=0..28.

FORMULA

a(n)=a(n-3)+a(n-4)+a(n-5)+a(n-6)+a(n-7)+a(n-8)

EXAMPLE

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,...

CROSSREFS

Sequence in context: A061565 A077075 A190660 * A320689 A173693 A058278

Adjacent sequences:  A180155 A180156 A180157 * A180159 A180160 A180161

KEYWORD

nonn

AUTHOR

Rob Cummings (robc(AT)rocoto.demon.co.uk), Aug 14 2010

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 17 03:06 EST 2019. Contains 329216 sequences. (Running on oeis4.)