587202560

Appears in sequences

• Expansion of (x-1)*(x^2-4*x-1)/(1-2*x)^2.at n=24A003232
• Number of rooted graphs on n labeled nodes where the root has degree 3.at n=4A038096
• First differences of A109975.at n=27A111297
• a(n) = (3*n+1)*2^n.at n=23A130129
• a(n) is 2^phi(n) times the least common multiple of the proper divisors of n.at n=35A189914
• Least number of the form 11*m-1 with exactly n prime factors, counted with multiplicity.at n=25A225210
• Number of n X 4 0..7 arrays with no element x(i,j) adjacent to itself or value 7-x(i,j) horizontally, diagonally, antidiagonally or vertically, top left element zero, and 1 appearing before 2 3 4 5 and 6, 2 appearing before 3 4 and 5, and 3 appearing before 4 in row major order (unlabelled 8-colorings with no clashing color pairs).at n=6A233164
• Number of n X 7 0..7 arrays with no element x(i,j) adjacent to itself or value 7-x(i,j) horizontally, diagonally, antidiagonally or vertically, top left element zero, and 1 appearing before 2 3 4 5 and 6, 2 appearing before 3 4 and 5, and 3 appearing before 4 in row major order (unlabeled 8-colorings with no clashing color pairs).at n=3A233167
• a(n) = smallest number whose arithmetic derivative has exactly n prime factors.at n=30A284149
• Triangle read by rows: T(n,k) is the number of nodes of degree k counted over all simple labeled graphs on n nodes, n>=1, 0<=k<=n-1.at n=31A285529
• Triangle read by rows: T(n,k) is the number of nodes of degree k counted over all simple labeled graphs on n nodes, n>=1, 0<=k<=n-1.at n=32A285529
• a(n) = lcm(n^n, factorial(n)/factorial(floor(n/2))^2).at n=8A294041
• Numbers of 3-regular one-face rooted maps on non-orientable surfaces.at n=5A348796
• Expansion of e.g.f. cosh(x)^2*(1 + x + x^2/2).at n=24A386227