48504

Appears in sequences

• Generalized Stirling number triangle of first kind.at n=16A051379
• Second unsigned column of triangle A051379.at n=5A051560
• Sum of terms in n-th row of A077164.at n=36A077167
• The PDO(n) function (Partitions with Designated summands in which all parts are Odd): the sum of products of multiplicities of parts in all partitions of n into odd parts.at n=44A102186
• Fifth right hand column of triangle A165674.at n=7A165677
• Integers k such that for all i > k the largest prime factor of i(i+1)(i+2)(i+3)(i+4)(i+5)(i+6) exceeds the largest prime factor of k(k+1)(k+2)(k+3)(k+4)(k+5)(k+6).at n=19A193948
• Integers n such that for all i > n the largest prime factor of product(i+k, {k,0,7}) exceeds the largest prime factor of product(n+k, {k,0,7}).at n=21A199407
• Integers n such that for all i > n the largest prime factor of product(i+k, {k,0,13}) exceeds the largest prime factor of product(n+k, {k,0,13}).at n=44A209837
• Values n, where n = p * q, and n, p, and q together contain all 10 digits at least once, and no digit is in more than one of n, p or q.at n=32A253173
• The internal state of the Sinclair ZX81 and Spectrum random number generator.at n=28A357907
• a(n) = Sum_{k = 0..n} 4^(n-k)*binomial(n,k)*binomial(n-1,k)*binomial(2*k,k).at n=5A362676
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where A(n,k) = [x^n] Product_{j=0..n} (1 + (k*n+j)*x).at n=25A382347
• a(n) = [x^n] Product_{k=0..n} (1 + (2*n+k)*x).at n=4A383678