This is a new OEIS sequence!

Found a bug? Please report it on GitHub!

- The goal of this game is to connect all "colors" (numbers 1..N) of a graph restricted to a square tiling—using the fewest number of vertices possible.
- In other words, for every n ≠ m, there needs to be a circle with n connected to a circle with m.
- (The links under "Best Solutions" contain some examples.)
- Clicking on a vertex will decrease the value in the circle and right clicking will increase the value in a circle.
- You can move vetices by clicking and dragging.
- If you type any character while your mouse is over a vertex, it will delete the vertex.
- The circle in the upper-left corner gives the color of the greatest sub-graph that is fully connected.
- The circle to the right of that records the "size" of the graph: the number of vertices in play.
- The red edges denote colors that are twice-connected.
- The "S" button will allow you to save your solution and update the high-scores table.
- The number in the upper-right corner will let you adjust the maximum labelling for a vertex.

- 2 ≤ f(2) ≤ 2
- 4 ≤ f(3) ≤ 4
- 6 ≤ f(4) ≤ 6
- 9 ≤ f(5) ≤ 9
- 12 ≤ f(6) ≤ 12
- 15 ≤ f(7) ≤ 15
- 19 ≤ f(8) ≤ 19
- 24 ≤ f(9) ≤ 24
- 30 ≤ f(10) ≤ 30
- 34 ≤ f(11) ≤ 34
- 40 ≤ f(12) ≤ 41
- 46 ≤ f(13) ≤ 48
- 56 ≤ f(14) ≤ 56
- 61 ≤ f(15) ≤ 63
- 69 ≤ f(16) ≤ 73
- 77 ≤ f(17) ≤ 82
- 90 ≤ f(18) ≤ 92
- 96 ≤ f(19) ≤ 101
- 106 ≤ f(20) ≤ 113
- 116 ≤ f(21) ≤ 122
- 132 ≤ f(22) ≤ 136