88704

Appears in sequences

• Theta series of A_7 lattice.at n=19A008447
• Expansion of e.g.f.: cos(arctan(x)*log(x+1))=1-12/4!*x^4+60/5!*x^5-90/6!*x^6+420/7!*x^7...at n=9A012400
• Determinant of n X n matrix M(i,j) = binomial(2i+1, j).at n=5A086228
• Unitary sigma-unitary phi super perfect numbers: USUP(USUP(n))= n/k for some integer k.at n=41A093863
• The following triangle contains n smallest numbers with the prime signature of n!. Sequence contains the triangle by rows.at n=32A111467
• Expansion of (1-8*x)^(-3/2).at n=5A115902
• Values of z in solutions (x,y,z) to the Diophantine equation x^3-x^2+y^3-y^2=z^3-z^2, with 1<x<y<z arranged in order of increasing x.at n=36A138669
• a(n) = 24*n*p(n) = 24*n*A000041(n).at n=15A183009
• 4-quantum transitions in systems of N>=4 spin 1/2 particles, in columns by combination indices.at n=17A213346
• a(0) = a(1) = 1, a(n) = n! / a(n-2).at n=12A214916
• Number of elements of order n in simple Mathieu group M_22.at n=4A284846
• Regular triangle T(n,k) = binomial(2*n-2*k,n-k)*((n+1)/k)*Sum_{k=0..floor((k-1)/2)} (-1)^k*binomial(2*k,k)*binomial(n+3*k-2*k,k-2*k-1), read by rows.at n=26A306625
• Triangular array read by rows: row n shows the coefficients of the polynomial p(x,n) constructed as in Comments; these polynomials form a strong divisibility sequence.at n=50A327320
• a(n) is the smallest number m with exactly n divisors that are Zuckerman numbers, or -1 if there is no such m.at n=23A335038
• Integers whose number of divisors that are Zuckerman numbers sets a new record.at n=18A340638
• a(n) = 1/(Sum_{k=1..n} 1/phi(A341810(n)*k)).at n=28A341811
• Maximum number of ways in which a set of integer-sided squares can tile an n X 3 rectangle.at n=18A362144
• Maximum number of ways in which a set of integer-sided squares can tile an n X 3 rectangle, up to rotations and reflections.at n=20A362261
• a(n) = (2*n)!/a(n-1), with a(0)=1.at n=6A372986
• a(n) is the first number with a total of exactly n 4's in the decimal digits of its divisors.at n=40A386391