53337
domain: N
Appears in sequences
- Number of nX4 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,3,0,2,2 for x=0,1,2,3,4.at n=6A197453
- Number of n X 7 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 3,3,0,2,2 for x=0,1,2,3,4.at n=3A197455
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 3,3,0,2,2 for x=0,1,2,3,4.at n=48A197457
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 3,3,0,2,2 for x=0,1,2,3,4.at n=51A197457
- G.f. satisfies: A(x) = Sum_{n>=0} n^n * x^n / (A(x) + n*x)^n.at n=8A211207
- Number of n X 3 nonnegative integer arrays with upper left 0 and lower right its king-move distance away minus 2 and every value within 2 of its king move distance from the upper left and every value increasing by 0 or 1 with every step right, diagonally se or down.at n=39A253218
- The sum of the numbers on straight lines of incrementing length n when drawn over numbers of the square spiral, where each line contains numbers which sum to the minimum possible value, and each number on the spiral can only be in one line. If two or more lines exist with the same sum the one containing the smallest number is chosen.at n=40A340974