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.

A242681 The number of ways that a score of n can be obtained using two darts on a standard dartboard.

Original entry on oeis.org

1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 11, 11, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 14, 15, 14, 14, 14, 14, 14, 16, 14, 15, 14, 14, 13, 15, 13, 15, 13, 13, 12, 14, 11, 14, 11, 11, 10, 11, 8, 12, 8, 8, 9, 9, 6, 10, 6, 6, 7, 6, 4, 8, 4, 4, 6, 4, 3, 7, 2, 3, 5, 2, 2, 5, 1, 2, 4, 2, 1, 4, 0, 1, 3, 0, 1, 3, 0, 1, 2, 0, 0, 2, 0, 0, 1, 0, 0, 1
Offset: 2

Views

Author

Colin Barker, May 20 2014

Keywords

Comments

It is assumed that each of the two darts scores.

Examples

			a(2) = 1 because the only possible throw is (1,1).
a(7) = 3 because possible throws are (1,6), (2,5) and (3,4).
a(103) = 0 because it is not possible to get a score of 103.
		

Crossrefs