94080

Appears in sequences

• Expansion of (1+x^3*C)*C^4, where C = (1-(1-4*x)^(1/2))/(2*x) is g.f. for Catalan numbers, A000108.at n=9A071729
• Product{[n/k + 1/2]: k=1,2,...,n}, where [x + 1/2] denotes the integer nearest to x.at n=13A075999
• Matrix square of unsigned Lah triangle abs(A008297(n,k)) or A105278(n,k).at n=32A079621
• Sum of the non-unitary divisors of A064115(n) (or of 1+A064115(n)).at n=7A103846
• The following triangle contains n smallest numbers with the prime signature of n!. Sequence contains the triangle by rows.at n=33A111467
• Kekulé numbers for certain benzenoids (see the Cyvin-Gutman book for details).at n=8A123348
• a(n) = 8*n^4+44*n^3+106*n^2+100*n+30.at n=10A129029
• A triangular sequence from umbral calculus expansion of _Simon Plouffe_'s rational polynomial for A002890: p(x,t) = exp(x*t)*(1 - 6*t + 9*t^2 - 4*t^3 + t^4)/(4*t - 1)/(2*t - 1).at n=39A137514
• a(n) = A002952(n) + A002953(n).at n=4A180277
• Product of the nonzero digits (in base 10) of n^4.at n=45A218215
• Integer areas of integer-sided triangles where two sides are of square length.at n=31A232461
• Triangle read by rows, T(n, k) = 4^n*[x^k]hypergeometric([3/2, -n], [3], -x), n>=0, 0<=k<=n.at n=32A254632
• Triangle read by rows, T(n,k) = sum(j=0..2*(n-k), A254882(n-k,j)*k^j /(n-k)!), n>=0, 0<=k<=n.at n=49A254883
• a(n) = (4*n+8)*n^2.at n=28A258617
• Triangle read by rows: T(n,k) is the number of subpermutations of an n-set, whose orbits are each of size at most k with at least one orbit of size exactly k, and without fixed points. Equivalently, T(n,k) is the number of partial derangements of an n-set each of whose orbits is of size at most k with at least one orbit of size exactly k, and without fixed points.at n=42A261765
• p-INVERT of (1,0,1,0,0,0,0,...), where p(S) = (1 - 2 S)^2.at n=10A291732
• A(n,k) = Sum_{j=0..n} (k*n)!/(j! * (n-j)!)^k, square array A(n,k) read by antidiagonals, for n >= 0, k >= 0.at n=24A306641
• a(n) = Sum_{k=0..n} (3*n)!/(k! * (n-k)!)^3.at n=3A306642
• a(n) = Sum_{k=0..n} (n^2)!/(k! * (n-k)!)^n.at n=3A306644
• Number of defective (binary) heaps on n elements where three ancestor-successor pairs do not have the correct order.at n=10A324064