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.

Showing 1-2 of 2 results.

A352422 Number of points available in a frame of snooker when there are n object balls remaining on the table.

Original entry on oeis.org

0, 7, 13, 18, 22, 25, 27, 35, 43, 51, 59, 67, 75, 83, 91, 99, 107, 115, 123, 131, 139, 147
Offset: 0

Views

Author

Stephen Cronin, Apr 25 2022

Keywords

Examples

			For n=7 there are 35 points on the table.
6 of these object balls are the non-reds and are worth a total of 27 points (2 for yellow, 3 for green, 4 for brown, 5 for blue, 6 for pink, 7 for black). The remaining red ball has a potential value of 8 points if its potting is followed by a potting of the black. 27 + 8 * 1 = 27 + 8 = 35
		

Crossrefs

Programs

  • Mathematica
    Table[If[n <= 15, 147 - 8*n, 27 - (n - 15)*(n - 12)/2], {n, 0, 21}] // Reverse (* Vaclav Kotesovec, May 04 2022, adapted to changed data May 11 2022 *)

A356948 Sequence of scores adding to maximum break in snooker.

Original entry on oeis.org

1, 7, 1, 7, 1, 7, 1, 7, 1, 7, 1, 7, 1, 7, 1, 7, 1, 7, 1, 7, 1, 7, 1, 7, 1, 7, 1, 7, 1, 7, 2, 3, 4, 5, 6, 7
Offset: 1

Views

Author

William B. Faulk, Sep 05 2022

Keywords

Comments

Since there are only 15 red balls, it is obvious that this is maximal and unique. The total is 147, the highest possible break. Ronnie O'Sullivan took only five minutes and 27 seconds to make this break at the 1997 World Championship. This is "easy" only if you are the world champion. - N. J. A. Sloane, Oct 15 2022

Crossrefs

First difference of A241263.

Programs

  • Python
    for i in range(15):
        print(1)
        print(7)
    for i in range(2, 8):
        print(i)

Extensions

Added two videos showing Ronnie O'Sullivan, one of the greatest players of all time. - N. J. A. Sloane, Oct 16 2022
Showing 1-2 of 2 results.