The problem of the calissons: number of ways to tile a hexagon of edge n with diamonds of side 1. Also number of plane partitions whose Young diagrams fit inside an n X n X n box.
A008793
The problem of the calissons: number of ways to tile a hexagon of edge n with diamonds of side 1. Also number of plane partitions whose Young diagrams fit inside an n X n X n box.
Terms
- a(0) =1a(1) =2a(2) =20a(3) =980a(4) =232848a(5) =267227532
External references
- oeis: A008793