|
Search: id:A105074
|
|
|
| A105074 |
|
Number of ways to fill in an n X n grid (or "crossword") such that each row and column is a perfect square. |
|
+0
1
|
| |
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Leading zeros are forbidden in the rows and columns.
|
|
EXAMPLE
|
The 1 X 1 crosssquare-puzzle is easy. Only 1, 4, 9 are the solutions.
The 4 solutions for n=2:
16 36 64 81
64 64 49 16
|
|
CROSSREFS
|
Sequence in context: A095790 A109474 A053910 this_sequence A087884 A057570 A024853
Adjacent sequences: A105071 A105072 A105073 this_sequence A105075 A105076 A105077
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
Matthijs Coster (matthijs(AT)coster.demon.nl), Apr 29 2005
|
|
|
Search completed in 0.002 seconds
|
