3276800

Appears in sequences

• Numbers of form 8^i*10^j, with i, j >= 0.at n=30A025634
• 19-almost primes (generalization of semiprimes).at n=11A069280
• a(n) is the number of occurrences of 11s in the palindromic compositions of m=2*n-1 = the number of occurrences of 12s in the palindromic compositions of m=2*n.at n=16A079863
• Triangle of coefficients in expansion of sinh^2(n*x) in powers of sinh(x).at n=48A082649
• Smallest number beginning with 3 and having exactly n prime divisors counted with multiplicity.at n=18A106423
• a(n) = (n^3 - n^2)*8^n.at n=4A128991
• Third differences of A129952.at n=19A129955
• Number of binary strings of length n with equal numbers of 0001 and 1000 substrings.at n=22A164161
• a(n) = n^4*(3*n+2).at n=16A229147
• Number of (n+1) X (n+1) 0..2 arrays with every 2 X 2 subblock diagonal maximum minus antidiagonal minimum unequal to its neighbors horizontally, vertically, diagonally and antidiagonally.at n=13A253461
• a(n)=least k such that A284821(n) = A284761(k).at n=32A284822
• a(n) = coefficient of x^(2*n) in C(x) defined by: C(x) + i*S(x) = Sum_{n=-oo..+oo} i^n * (2*x)^(n^2) * F(x)^n, where F(x) is the g.f. of A357787 such that C(x)^2 + S(x)^2 = 1.at n=8A357788
• a(n) is the index of the smallest tetrahedral number with exactly n prime factors (counted with multiplicity), or -1 if no such number exists.at n=28A359090
• a(n) is the number of exterior top arches (no covering arch) for semi-meanders in generation n+1 that are generated by semi-meanders with n top arches and floor((n+2)/2) exterior top arches using the exterior arch splitting algorithm.at n=31A365679