86550

Appears in sequences

• Numbers k such that k has nonincreasing digits and the k-th prime has nondecreasing digits.at n=48A116069
• Number of (n+2)X(3+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 3 4 6 or 7.at n=4A252100
• Number of (n+2)X(5+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 3 4 6 or 7.at n=2A252102
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 3 4 6 or 7.at n=23A252105
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 3 4 6 or 7.at n=25A252105
• Square array A(1,k) = A265905(k), A(n>1,k) = A(n-1, k+1) - A(n-1, k); successive differences of A265905 read by descending antidiagonals as A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...at n=32A275950
• Transpose of array A275950.at n=31A275951
• Smallest m >= 2*n such that binomial(m,n) is a multiple of m-i for all 0<=i<n, but one.at n=24A389360