38080

Appears in sequences

• Number of nonseparable tree-rooted planar maps with n + 2 edges and 3 vertices.at n=13A006411
• Triangle of coefficients of Gandhi polynomials.at n=22A058942
• Numbers expressible as (a^2-1)(b^2-1) in at least 2 distinct ways (b>=a>1).at n=24A063067
• a(1)=1, a(n) = n*a(floor(n/2)).at n=34A098844
• If X_1,...,X_n is a partition of a 2n-set X into 2-blocks then a(n) is equal to the number of 4-subsets of X containing none of X_i, (i=1,...,n).at n=13A130810
• a(n) = floor(p/2) * floor(floor(p/2)/2) * floor(floor(floor(p/2)/2)/2) * ... * 1, where p=prime(n).at n=19A163467
• Number of ways to place 2 nonattacking nightriders on an n X n board.at n=16A172141
• Largest members of fully k-sociable cycles of order r.at n=20A183023
• Conjectured list of fully multisociable numbers.at n=35A183029
• a(n)=Product{k=0..n, A003665(k)}.at n=4A186270
• Numbers with prime factorization pqrs^6.at n=18A190292
• Number of (w,x,y,z) with all terms in {1,...,n} and w^2>x*y*z.at n=23A212066
• The denominators of Zagier's modification of the Bernoulli numbers.at n=15A216923
• Total sum of parts of multiplicity 5 in all partitions of n.at n=41A222733
• a(n) = sigma(2*n^3) - sigma(n^3).at n=25A225959
• Triangle T read by rows: T(n,k) = binomial(2*n+1,k)*binomial(n,k), n>=0, 0<=k<=n.at n=39A252501
• Triangle read by rows: T(n,k) = number of colored weighted Motzkin paths ending at (n,k).at n=40A293172
• Number of nonisomorphic proper colorings of partition multicycle graph using six colors.at n=70A298266
• a(n) = n*(2*n - 3 - (-1)^n)*(11*n + (-1)^n)/24.at n=34A308026
• a(n) is the number of subsets of {1..n} that contain exactly 4 odd and 1 even numbers.at n=33A333320