65009

Appears in sequences

• a(n) = (10n+1)*(10n+9).at n=25A001535
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (0, 0, -1), (0, 1, -1), (1, 0, 1)}.at n=10A149100
• Number of n X 4 0..1 arrays with each 1 adjacent to 1 or 3 king-move neighboring 1's.at n=6A295939
• Number of nX7 0..1 arrays with each 1 adjacent to 1 or 3 king-move neighboring 1s.at n=3A295942
• T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 1 or 3 king-move neighboring 1s.at n=48A295943
• T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 1 or 3 king-move neighboring 1s.at n=51A295943