47394

Appears in sequences

• Write the numbers from 1 to n^2 in a spiraling square; a(n) is the total of the sums of the two diagonals.at n=33A059924
• Number of (2+1)X(n+1) arrays of permutations of 0..n*3+2 with each element having directed index change -1,1 0,-1 0,1 or 1,0.at n=9A264508
• Triangle read by rows: T(n,k) is the maximum number of ways in which a set of integer-sided squares can tile an n X k rectangle, 0 <= k <= n.at n=42A362142