63270
domain: N
Appears in sequences
- a(n) = floor( n*(n-1)*(n-2)*(n-3)/28 ).at n=38A011938
- T(n,n-6), where T is the array in A055830.at n=17A055833
- Number of (n+1)X(n+1) 0..2 arrays with the number of equal 2X2 subblock diagonal pairs and equal antidiagonal pairs differing from each horizontal or vertical neighbor, and new values 0..2 introduced in row major order.at n=2A205327
- Number of (n+1)X4 0..2 arrays with the number of equal 2X2 subblock diagonal pairs and equal antidiagonal pairs differing from each horizontal or vertical neighbor, and new values 0..2 introduced in row major order.at n=2A205330
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the number of equal 2X2 subblock diagonal pairs and equal antidiagonal pairs differing from each horizontal or vertical neighbor, and new values 0..2 introduced in row major order.at n=12A205335
- Number of n X 4 0..1 arrays avoiding 0 0 1 and 1 0 0 horizontally and 0 0 1 and 1 0 1 vertically.at n=18A209646
- a(n) = n*(n + 1)*(7*n + 11)/6.at n=37A255687
- Expansion of 30*x*(1 + x) / (1 - x)^4.at n=17A316459
- Number of ways to write n as an ordered sum of 9 nonzero triangular numbers.at n=41A340954
- Those primitive elements of A337386 that have exactly one primitive nondeficient divisor (A006039).at n=24A341604
- G.f.: Sum_{k>=0} x^(k^2) * Product_{j=1..k} 1/(1 - x^j)^3.at n=28A376709