240288

Appears in sequences

• Number of linear arrangements of n blue, n red and n green items such that there are no adjacent items of the same color (first and last elements considered as adjacent).at n=6A110707
• Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = k if k <= floor(n/2) otherwise n-k, and m = 3, read by rows.at n=46A157209
• Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = k if k <= floor(n/2) otherwise n-k, and m = 3, read by rows.at n=53A157209
• Number of (n+1)X(2+1) 0..3 arrays with the maximum plus the upper median plus the minimum minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=2A237781
• Number of (n+1)X(3+1) 0..3 arrays with the maximum plus the upper median plus the minimum minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=1A237782
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum plus the upper median plus the minimum minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=7A237785
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum plus the upper median plus the minimum minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=8A237785
• T(n,k) = number of circular arrays of n 1's, n -1's, and k 0's such that no two adjacent elements are equal.at n=56A283614
• Numbers k such that Bernoulli number B_{k} has denominator 4501770.at n=24A295597