cp's OEIS Frontend

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.

A128310 List of maximal breaks in generalized snooker.

Original entry on oeis.org

5, 9, 11, 14, 17, 20, 24, 27, 29, 32, 35, 39, 41, 44, 45, 47, 50, 51, 54, 59, 62, 65, 74, 75, 77, 84, 86, 87, 89, 90, 101, 104, 107, 110, 114, 116, 117, 119, 120, 125, 132, 135, 137, 140, 144, 147, 149, 152, 155, 164, 167, 170, 174, 182, 185, 186, 189, 194, 195, 200
Offset: 1

Views

Author

Jonas Wallgren, May 04 2007

Keywords

Comments

Given A000217(R) red balls and C colored balls. For every red ball 1 point for it and C+1 points for the highest colored ball, followed by 2+3+4+... points for all colored balls. This sequence contains all numbers on the form A000217(R)*(C+2)+A000217(C+1)-1, R>0, C>0 (sorted, duplicates removed).

Examples

			Let R=2 (1 point each) and C=3 (2, 3 and 4 (call that one black) points). The sequence red-black-red-black-red-black-2-3-black gives 24 points. Thus 24 is an element in this sequence.