364544

Appears in sequences

• Number of permutations of {1,2,...,n} that result in a binary search tree (when elements of the permutation are inserted in that order) of height n-1 (i.e., the second largest possible height).at n=14A076616
• Expansion of (1-x)/(1+2*x-2*x^3).at n=29A078060
• a(n) = -2*a(n-1) + 4*a(n-2), a(0) = 1, a(1) = 0.at n=12A086344
• Numbers with 26 divisors.at n=22A137489
• a(n) = 2*a(n-1) + 4*a(n-2) with n>1, a(0)=0, a(1)=4.at n=11A209084
• T(n,k)=Number of nXk arrays of permutations of 0..n*k-1 with rows nondecreasing modulo 3 and columns nondecreasing modulo 4.at n=23A264643
• Number of 3Xn arrays of permutations of 0..n*3-1 with rows nondecreasing modulo 3 and columns nondecreasing modulo 4.at n=4A264645
• Expansion of Sum_{k>=1} mu(k)*log(1 + x^k/((1 - x^k)*(1 - 2*x^k)))/k.at n=22A308447
• Expansion of Product_{1 <= i <= j <= k} 1/(1 - x^(i*j*k)).at n=41A321360
• Expansion of Product_{k>=1} (1 + 8^(k-1)*x^k).at n=7A344067
• Number of minimum dominating sets in the 2 X n king graph.at n=33A350816
• a(n) is the next number after n! with the same number of prime factors as n!, counted with multiplicity.at n=7A376420