126720

Appears in sequences

• a(n) = 2^(n-4)*C(n,4).at n=8A003472
• a(n) = 4^n*(3*n)!/((2*n)!*n!).at n=4A006588
• 9-fold convolution of A000302 (powers of 4).at n=4A054339
• Triangle of numbers of square lattice walks that start and end at origin after 2k steps and contain exactly r steps to the east, not touching origin at intermediate stages.at n=24A068218
• Maximum number of pairwise incomparable subcubes of the discrete n-cube. Largest antichain in partial ordering {0,1,*}^n where 0 and 1 are less than *. Maximum number of implicants in an irredundant disjunctive normal form for n Boolean variables.at n=12A109388
• Triangle T(n, k) = binomial(2*n-k, k)*(-4)^(n-k), read by rows.at n=40A117438
• a(n) = binomial(n+3,4)*4^4.at n=8A120054
• a(n) = (32/2)*(n-1)*(n-2)*(n-3)*(n-4).at n=11A134175
• Expansion of o.g.f. 2*(1+x)^2/(1-2*x+sqrt(1-8*x)).at n=7A182959
• a(n) = n*(n+2)*(n+4)*(n+6).at n=15A190577
• a(n) = A080358(n)/A000178(n) where A000178 are superfactorials.at n=5A203314
• a(n) = A203418(n)/A000178(n).at n=7A203420
• Number of n X 4 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 0 1 1 vertically.at n=22A208065
• Array read by antidiagonals: T(m,n) = m*(m+n-1)! + Sum( n <= i <= m+n-2 ) i!at n=30A211369
• Number of (w,x,y,z) with all terms in {1,...,n} and w<2x and y>=3z.at n=32A212511
• 1-quantum transitions in systems of N spin 1/2 particles, in columns by combination indices. Triangle read by rows, T(n, k) for n >= 1 and 0 <= k <= floor((n-1)/2).at n=31A213343
• 4-quantum transitions in systems of N>=4 spin 1/2 particles, in columns by combination indices.at n=20A213346
• 90*A002451(n).at n=3A213455
• Positive numbers differing from next 3 greater squares by squares.at n=10A218487
• Triangle where the g.f. for row n equals d^n/dx^n (1+x+x^2)^n / n! for n>=0, as read by rows.at n=47A220178