860160

Appears in sequences

• a(n) = n*(n+1)*2^(n-2).at n=14A001788
• Coordination sequence for diamond structure D^+_14. (Edges defined by l_1 norm = 1.)at n=9A035883
• 5-fold convolution of A000302 (powers of 4); expansion of 1/(1-4*x)^5.at n=6A040075
• a(n) = ((2*n)!/n!)*2^(2*n+1).at n=5A052737
• Triangle of idempotent numbers binomial(n,k)*k^(n-k), version 2.at n=48A059298
• Triangle of idempotent numbers binomial(n,k)*k^(n-k), version 4.at n=51A059300
• a(n) = number of endofunctions on [n] with a 4-cycle a->b->c->d->a and for any x in [n], some iterate f^k(x) = a.at n=4A065888
• Maximal number of divisors of any n-digit number.at n=22A066150
• 16-almost primes (generalization of semiprimes).at n=29A069277
• Third binomial transform of binomial(n+3, 3).at n=8A081896
• a(n) = (n^3 - n)*4^n.at n=5A128962
• a(n) = binomial(n+6, 6)*8^n.at n=4A140406
• Product of digits of all the divisors of n.at n=55A190997
• Triangular array read by rows. T(n,k) is the number of connected endofunctions on {1,2,...,n} that have exactly k nodes in the unique cycle of its digraph representation.at n=31A201685
• Numbers n such that there are three distinct triples (k, k+n, k+2n) of squares.at n=22A222154
• a(n) = denominator(Jtilde3(n)).at n=4A264542
• a(n) = (7*n)!*(3/2*n)!/((7*n/2)!*(3*n)!*(2*n)!).at n=3A276098
• a(n) = denominator(Bernoulli(n, x/2) - Bernoulli(n)).at n=13A287705
• a(n) = denominator(Bernoulli(n, x/2) - Bernoulli(n, x)).at n=13A287706
• Coefficients of q-expansion of Eisenstein series G_{9/2}(tau) multiplied by 240.at n=41A306936