1290240

Appears in sequences

• Number of Hamiltonian cycles in the directed graph with 2n nodes {0..2n-1} and edges from each i to 2i (mod 2n) and to 2i+1 (mod 2n).at n=25A027362
• a(n) = 2^n*(n-1)! for n > 1, a(1) = 1.at n=7A032184
• a(n) = (2*n+4)!!/4!!, related to A000165 (even double factorials).at n=6A051578
• Number of binary Lyndon words with an even number of 1's.at n=25A051841
• Expansion of e.g.f. x^2*(1-x)/(1-2*x).at n=8A052587
• A simple context-free grammar in a labeled universe: labeled version of A049140.at n=7A052740
• 2^(n-2)*n*(n+2)!/3.at n=6A058667
• Least number whose number of divisors is n-th term from A014613 (numbers of form p*q*r*s, products of exactly 4 primes, counted with multiplicity).at n=20A061218
• Denominators in the series for Bessel function J6(x).at n=1A061405
• Maximal number of divisors of any n-digit number.at n=23A066150
• Number of necklaces with n labeled beads of 2 colors.at n=7A066318
• Product of the next n multiples of n.at n=3A072529
• Analog of A095236 when the phones are arranged in a circle.at n=13A095239
• a(n) = product of next n even numbers beginning with n if n is even, otherwise product of next n odd numbers beginning with n.at n=5A113551
• Duplicate of A032184.at n=6A130683
• A triangular sequence based on expansion of the rational polynomial of A001788 as a Sheffer sequence: p(x,t)=Exp[x*t]*(-1/(2*t - 1)^3).at n=21A138192
• Smallest number d such that the smallest number with d divisors is a multiple of n.at n=52A143986
• Triangle read by rows: T(n,m)=floor[(m/n)*row(n)].at n=38A152969
• Triangle read by rows: T(n,m)=floor[(m/n)*row(n)].at n=42A152969
• Array read by antidiagonals: T(n,k) = (k+1)^n*(n+k)!.at n=31A154120