21740

Appears in sequences

• Number of partitions satisfying cn(0,5) < cn(2,5) + cn(3,5).at n=37A039841
• Number of transitions necessary for a Turing machine to compute the differences between consecutive primes (primes written in unary), when using the instruction table below.at n=26A078612
• Number of binary words of length n containing at least one subword 10^{9}1 and no subwords 10^{i}1 with i<9.at n=56A143289
• Greatest number m such that the fractional part of (1024/1000)^A153680(n) >= 1-(1/m).at n=9A153684
• Number of superdiagonal bargraphs with area n.at n=34A219282
• a(n) = [x^n] ((Sum_{k=0..n} (k+7)!*x^k)/(Sum_{k=0..n} (k+7)!*(-x)^k))^(1/8).at n=6A303569
• a(n) = Sum_{d|n} d^gcd(d,n/d).at n=47A344461
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of B(x)^k, where B(x) is the g.f. of A088714.at n=61A379599