The maximal number of solutions for a given row of a skyscraper puzzle of size n X n.
A218531
The maximal number of solutions for a given row of a skyscraper puzzle of size n X n.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =6a(4) =22a(5) =105a(6) =675a(7) =4872a(8) =40614a(9) =403704a(10) =4342080a(11) =50457000a(12) =631548456a(13) =8484089328a(14) =121882518576
External references
- oeis: A218531