56960
domain: N
Appears in sequences
- Antidiagonal sums of array A089900.at n=7A089902
- Icosagonal numbers divisible by 20.at n=16A117798
- Rolling icosahedron footprints: number of n X 3 0..11 arrays starting with 0 where 0..11 label vertices of an icosahedron and every array movement to a horizontal, vertical or antidiagonal neighbor moves along an icosahedral edge.at n=5A223181
- Rolling icosahedron footprints: number of nX6 0..11 arrays starting with 0 where 0..11 label vertices of an icosahedron and every array movement to a horizontal, vertical or antidiagonal neighbor moves along an icosahedral edge.at n=2A223184
- T(n,k) = Rolling icosahedron footprints: number of n X k 0..11 arrays starting with 0 where 0..11 label vertices of an icosahedron and every array movement to a horizontal, vertical or antidiagonal neighbor moves along an icosahedral edge.at n=30A223186
- T(n,k) = Rolling icosahedron footprints: number of n X k 0..11 arrays starting with 0 where 0..11 label vertices of an icosahedron and every array movement to a horizontal, vertical or antidiagonal neighbor moves along an icosahedral edge.at n=33A223186
- T(n,k)=Number of length n+4 0..k arrays with some disjoint pairs in every consecutive five terms having the same sum.at n=36A247927
- Number of length 1+4 0..n arrays with some disjoint pairs in every consecutive five terms having the same sum.at n=8A247928
- Column 5 of A060244.at n=28A291590
- a(n) = Sum_{j=0..n} (-1)^j*binomial(2*n - j, j)*c(n - j + 1)^2, where c(n) is the n-th Catalan number.at n=6A358118
- Triangle read by rows: T(n,k) is the number of pairs (c,m), where c is a covering of the 1 X (2n) grid with 1 X 2 rectangles and equal numbers of red and blue 1 X 1 squares and m is a matching between red squares and blue squares, such that exactly k matched pairs are adjacent.at n=24A360441