How many different ways are there to fully tile a 2n x 2n grid with dominoes? Here "different" means apparently different. Further, how many unique ways are there? Here "unique" excludes all redundant configurations that are rotations and/or reflections of another. Find the different and unique ways up to 2n=8.
I put the solution in OEIS
A316535