128000

Appears in sequences

• a(n) = Product_{i=0..7} floor((n+i)/8).at n=35A009694
• Numbers of form 4^i*5^j, with i, j >= 0.at n=39A025617
• a(n) = 2*n^3.at n=40A033431
• Triangle whose (i,j)-th entry is binomial(i,j)*5^(i-j)*8^j.at n=18A038250
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*5^j.at n=17A038283
• a(n)=2*a(n-1), except every tenth time you multiply by 1000/512 instead of by 2.at n=17A051535
• Numbers of the form 2^i*5^j where i+j is odd.at n=37A054774
• Nearest integer to n^5/25.at n=19A061003
• Expansion of (1-x)/(1-2*x+2*x^2-2*x^3).at n=30A078003
• a(1)=1 and for n>1, a(n) is the smallest multiple of a(n-1) which has no nonzero digit in common with a(n-1).at n=13A079838
• Product of nonzero digits in n-th row of Pascal's triangle.at n=10A086992
• Number of permutations p of (1,2,3,...,n) such that k+p(k) is a Fibonacci number for 1 <= k <= n.at n=52A097082
• Triangle read by rows: T(n,k) is the number of Motzkin paths of length n having k high humps. (A hump is an upstep followed by 0 or more flatsteps followed by a downstep. A high hump is a hump that starts at a level higher than zero.).at n=53A097888
• Number of divisors of 240^n.at n=31A103532
• Number of divisors of n!! (double factorial = A006882(n)).at n=42A114338
• Coefficient of q^n in (1-q)^5/(1-5q); dimensions of the enveloping algebra of the derived free Lie algebra on 5 letters.at n=8A118266
• (1,3)-entry of the 3 X 3 matrix M^n, where M = {{0, -1, 1}, {1, 1, 0}, {0, 1, 1}}.at n=31A122788
• a(n) = n^3*4^n.at n=5A128790
• a(n) = 2^n*(2^n + n)^(n-1).at n=4A136524
• a(n) = a(n-2) + a(n-3) if n == 0 (mod 3), a(n-1) + a(n-4) if n == 0 (mod 4), otherwise a(n-2) with a(0) = 0 and a(1) = a(2) = a(3) = 1.at n=51A141525