31888

Appears in sequences

• T(n,m) = number of 0..m-1 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1.at n=60A171307
• Number of 0..5 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1.at n=5A171311
• Number of 0..n-1 integer arrays v[1..6] of length 6 with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..5.at n=5A171357
• T(n,k)=Number of n-turn queen's tours on a kXk board summed over all starting positions.at n=47A186965
• Number of 3-turn queen's tours on an n X n board summed over all starting positions.at n=7A186966
• Equals one maps: number of nX2 binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal, vertical and antidiagonal neighbors in a random 0..1 nX2 array.at n=8A220456
• T(n,k)=Equals one maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal, vertical and antidiagonal neighbors in a random 0..1 nXk array.at n=46A220461
• Number of 2-face-free maps on n edges.at n=8A220899