46448640

Appears in sequences

• a(n) = n! * C(n+2, 2) * 2^(n+1).at n=7A014297
• Form a triangle with n numbers in top row; all other numbers are the product of their parents. The numbers must be positive and distinct and the final number is to be minimized.at n=4A028308
• Triangle whose (i,j)-th entry is binomial(i,j)*4^(i-j)*12^j.at n=32A038242
• Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*4^j.at n=31A038330
• Expansion of e.g.f. x*(1-x)/(1-2*x).at n=9A052564
• E.g.f. x^2*(1+x-2x^2)/(1-2x).at n=9A052638
• Startorial numbers: product of initial digits of integers 1 through n.at n=25A109834
• Number of permutations on 1..n where gcd(s_i,n) = gcd(i,n). Also Product_{d divides n} phi(d)!.at n=19A120065
• Number of divisors of A138113(n).at n=34A140410
• The decomposition of a certain labeled universe (A052584), triangle read by rows.at n=43A159749
• a(n) = sqrt(floor(n/2)! * Product_{k=1..n} Product_{i=1..k-1} gcd(k,i)).at n=14A224497
• Number of nXnXn triangular 0..2 arrays with new values introduced in sequential zero-upwards order and exactly one upright 2x2x2 triangle having values all equal and exactly one upright 2x2x2 triangle having values all different.at n=5A271514
• T(n,k)=Number of nXnXn triangular 0..k arrays with new values introduced in sequential zero-upwards order and exactly one upright 2x2x2 triangle having values all equal and exactly one upright 2x2x2 triangle having values all different.at n=26A271517
• Number of self-orthogonal diagonal Latin squares of order n.at n=7A287762
• Partial products of the unitary totient function (A047994): a(n) = Product_{k=1..n} uphi(k).at n=12A321613
• Number of doubly self-orthogonal diagonal Latin squares of order n.at n=7A333671
• Denominator of the expected fraction of guests without a napkin in Conway's napkin problem with n guests.at n=8A341233
• Triangular array read by rows: T(n,k) is the number of labeled tournaments on [n] that have exactly k irreducible (strongly connected) components, n >= 0, 0 <= k <= n.at n=49A354607