504509

Appears in sequences

• Number of ways to place zero or more nonadjacent 0,0 1,0 1,1 2,0 2,2 3,0 3,3 polyhexes in any orientation on a planar nXnXn triangular grid.at n=10A155316
• a(n) is the smallest number which can be represented as the sum of n distinct nonzero n-gonal numbers in exactly 2 ways.at n=39A377729