267227532

Appears in sequences

• 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.at n=5A008793
• a(n) = Product_{i=1..n} ((i+5)*(i+6)*(i+7)*(i+8)*(i+9))/(i*(i+1)*(i+2)*(i+3)*(i+4)).at n=5A047831
• Triangle of Hankel transforms of certain binomial sums.at n=49A120257