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

Author

John Tromp, Jan 26 2016

Keywords

• nonn
• more

Examples

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

Links

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

Crossrefs

Cf. A094777, A102620, A266278.