A268125 Minimal order of recurrence for number of legal n X m Go positions, for fixed n.

3, 7, 19, 57, 217, 791, 3107, 12110, 49361

Offset

1,1

Links

Table of n, a(n) for n=1..9.

J. Tromp and G. Farnebäck, Combinatorics of Go, Lecture Notes in Computer Science, 4630, 84-99, 2007.

Example

For n=1 the minimal recurrence is L(1,m) = 3*L(1,m-1)-L(1,m-2)+L(1,m-3).

Crossrefs

Cf. A094777, A102620, A266278.

Sequence in context: A258171 A263334 A005506 * A287484 A201169 A148667

Adjacent sequences: A268122 A268123 A268124 * A268126 A268127 A268128

Keyword

nonn,more

Author

John Tromp, Jan 26 2016

Status

approved