40765

Appears in sequences

• a(n) = C(n+2,3) + C(n,3) + C(n-1,3).at n=43A006004
• Number of nX6 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of elements above it or three plus the sum of the elements diagonally to its northwest, modulo 4.at n=3A240191
• T(n,k)=Number of nXk 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or three plus the sum of the elements diagonally to its northwest, modulo 4.at n=39A240192
• Number of 4 X n 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or three plus the sum of the elements diagonally to its northwest, modulo 4.at n=5A240194
• Number of magic labelings with magic sum n of 4th graph shown in link.at n=7A244872
• Start with a single square; at n-th generation add a square at each expandable vertex (this is the "vertex to side" version); a(n) is the sum of all label values at n-th generation. (See comment for construction rules.)at n=21A247903
• Numbers that can be written in exactly two different ways in the form described by A387302.at n=9A387898