3954366

Appears in sequences

• Let G denote the 7-node, 12-edge graph formed from a hexagon with main diagonals drawn and a node at the center; a(n) = number of magic labelings of G with magic sum 2n.at n=25A244866
• Number of ways to remove n oranges from an infinite stack of oranges whose m-th layer is an m X (m+2) rectangle.at n=22A274596