111707

Appears in sequences

• Number of (n+2)X4 0..3 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically or nw-to-se diagonally exactly three ways, and new values 0..3 introduced in row major order.at n=6A204477
• Number of (n+2)X9 0..3 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically or nw-to-se diagonally exactly three ways, and new values 0..3 introduced in row major order.at n=1A204482
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically or nw-to-se diagonally exactly three ways, and new values 0..3 introduced in row major order.at n=29A204483
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically or nw-to-se diagonally exactly three ways, and new values 0..3 introduced in row major order.at n=34A204483
• Number of n X 5 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 1 1 0 vertically.at n=11A207108
• The point at which the powers of n merge on an 8-digit calculator.at n=20A216069
• Numbers with sum of digits equaling 17, divisible by 17, and containing the string "17".at n=13A346904
• a(0) = 1; a(n) = Sum_{k=0..floor((n-1)/3)} binomial(n,3*k+1) * a(k).at n=17A352879