51200
domain: N
Appears in sequences
- Expansion of (1 + 2*x)/(1 - 2*x)^3.at n=9A014477
- Numbers of form 8^i*10^j, with i, j >= 0.at n=17A025634
- Numbers that can be written as k/d(k) in four or more ways, where d(k) = number of divisors of k.at n=5A051346
- Duplicate of A051346.at n=5A051520
- Numbers of the form 2^i*5^j where i+j is odd.at n=32A054774
- 13-almost primes (generalization of semiprimes).at n=11A069274
- Expansion of (1-x)/(1+2*x^2+2*x^3).at n=23A078037
- Numbers n such that n, n+1, n+2, n+3, n+4 are all of the form x^2+2*y^2 for nonnegative x, y.at n=26A096783
- Smallest number beginning with 5 and having exactly n prime divisors counted with multiplicity.at n=12A106425
- Composite numbers k such that binomial(5*k, k) == 5^k (mod k).at n=10A109760
- Triangle of numbers related to the spectrum of the hydrogen (H) atom.at n=34A119937
- Denominators of partial alternating sums of Catalan numbers scaled by powers of 1/(5*8^2) = 1/320.at n=2A121011
- Number of indecomposable partitions of n.at n=41A122697
- Triangle read by rows: T(n,k) is the number of partitions of the set {1,2,...,n} having exactly k blocks that contain both odd and even entries (0<=k<=floor(n/2)).at n=32A124418
- Row sums of A128134.at n=12A128135
- Matrix log of triangle A111636, where A111636(n,k) = (2^k)^(n-k)*C(n,k) for n>=k>=0.at n=24A134530
- Expansion of (1-8x-8x^3)/(1-2x+4x^2)^2.at n=11A151912
- a(n) = n^6*(n+1)^2/2.at n=4A163276
- Number of binary strings of length n with equal numbers of 0001 and 1000 substrings.at n=16A164161
- Totally multiplicative sequence with a(p) = 8*(p+2) for prime p.at n=17A167309