[go: up one dir, main page]

login
A226978
Number of ways to cut an n X n square into squares with integer sides, reduced for symmetry, where the orbits under the symmetry group of the square, D4, have 1 element.
5
1, 2, 2, 4, 4, 12, 8, 44, 32, 228, 148, 1632, 912, 16004, 8420, 213680, 101508, 3933380, 1691008, 98949060, 38742844, 3413919788, 1213540776, 161410887252, 52106993880
OFFSET
1,2
COMMENTS
From Walter Trump, Dec 15 2022: (Start)
a(n) is the number of fully symmetric dissections of an n X n square into squares with integer sides.
Conjecture: For n>3 the number of dissections is a multiple of 4. (End)
FORMULA
a(n) + A226979(n) + A226980(n) + A226981(n) = A224239(n).
1*a(n) + 2*A226979(n) + 4*A226980(n) + 8*A226981(n) = A045846(n).
EXAMPLE
For n=5, there are 4 dissections where the orbits under the symmetry group of the square, D4, have 1 element.
For n=4, 3 dissections divide the square into uniform subsquares (of sizes 1, 2 and 4 respectively), and this is the 4th:
---------
| | | | |
---------
| | | |
--- ---
| | | |
---------
| | | | |
---------
KEYWORD
nonn,more
AUTHOR
EXTENSIONS
a(8)-a(12) from Ed Wynn, Apr 02 2014
a(13)-a(25) from Walter Trump, Dec 15 2022
STATUS
approved