48170

Appears in sequences

• Number of partitions with at most one part divisible by 5.at n=42A039905
• Triangle T(n,k) read by rows: T(n,k) = Sum_{j=0..k} (-1)^j *binomial(n+1,j)*(k+2-j)^n, 0 <= k < n.at n=51A180246
• Number of length 3+2 0..n arrays with no pair in any consecutive three terms totalling exactly n.at n=8A245998
• Number of (n+2)X(n+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 2 4 6 or 7.at n=3A252449
• Number of (n+2)X(4+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 2 4 6 or 7.at n=3A252453
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 2 4 6 or 7.at n=24A252457
• Number of (n+2)X(n+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=24A254899
• Number of tilings of a sphinx of order n with n^2 - 2 elementary sphinxes and a single sphinx domino that has two different tilings.at n=5A317541