5645376

Appears in sequences

• a(1) = 1, a(n+1) is the smallest square greater than the n-th partial sum.at n=21A076967
• Number of nX4 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 0 1 1 vertically.at n=19A207119
• Number of (n+1) X (5+1) arrays of permutations of 0..n*6+5 with each element having index change +-(.,.) 0,0 1,1 or 1,2.at n=3A264068
• T(n,k) = number of (n+1) X (k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 1,1 or 1,2.at n=31A264071
• Number of (4+1) X (n+1) arrays of permutations of 0..n*5+4 with each element having index change +-(.,.) 0,0 1,1 or 1,2.at n=4A264073
• Number of nX4 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,1) or (-1,-2) and new values introduced in order 0..2.at n=7A275348