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.

A273916 The Bingo-4 problem: minimal number of stones that must be placed on an infinite square grid to produce n groups of exactly 4 stones each. Groups consist of adjacent stones in a horizontal, vertical or diagonal line.

Table of values

n a(n)
0 0
1 4
2 7
3 9
4 11
5 12
6 12
7 14
8 15
9 16
10 16
11 18
12 19
13 20
14 22
15 24

List of values

[0, 4, 7, 9, 11, 12, 12, 14, 15, 16, 16, 18, 19, 20, 22, 24]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.