10644480

Appears in sequences

• 2^(2n-6) * C(n,3) - 2^(n-2) * C(n,4).at n=8A008465
• One quarter of octo-factorial numbers.at n=5A034910
• Minimal numbers having in canonical prime factorization at least one factor p^e such that e+1 is not prime, p prime and e>0.at n=28A099317
• Terms in A005179 where prime signature differs from that of corresponding term in A038547.at n=24A122813
• a(1) = 1, a(n) = a(n-1) if n == 1 (mod 4), otherwise a(n) = n * a(n-1) for n >= 2.at n=11A123145
• a(1) = 1, a(n) = a(n-1) if n == 1 (mod 4), otherwise a(n) = n * a(n-1) for n >= 2.at n=12A123145
• a(n) = lcm(b(0),b(1),b(2),...,b(n)), where b(m) = A130479(m).at n=12A130480
• Elements n of A141586 with property that A100762(n) = n.at n=33A141758
• a(n) = smallest term in A141586 that is divisible by 2^n but not by 2^(n+1).at n=10A141900
• Least number k such that the number of its divisors is n times the number of its prime factors, counted with multiplicity.at n=20A275819
• The number of positive integer sequences of length n with no duplicate substrings of length greater than 1, every number different from its neighbors, and a minimal product (= A282169(n)).at n=22A284434
• Fourier coefficients of Eisenstein series of degree 2 and weight 4: a(n) = coefficient of the matrix [n, 1/2; 1/2, 1] with determinant n-1/4.at n=9A323990
• Number of defective (binary) heaps on n elements where two ancestor-successor pairs do not have the correct order.at n=13A324063
• Array read by ascending antidiagonals: T(n, k) = (k*n)!/(k^n*(1/k)_n) with (n >= 0 and k >= 1), where (x)_n = x*(x + 1)*...*(x + n - 1) is the Pochhammer symbol.at n=24A329070
• a(n) is the smallest number m with exactly n divisors that are Zuckerman numbers, or -1 if there is no such m.at n=38A335038