81088
domain: N
Appears in sequences
- Expansion of sin(tanh(x))*cos(x).at n=4A009523
- Expansion of e.g.f. sinh(tan(x))*exp(x).at n=9A009605
- Matrix square of Stirling-1 triangle A008275.at n=31A039814
- Positive integers m such that (m+4)^3 - m^3 is a square.at n=7A263942
- T(n, k) = [x^k] Sum_{k=0..n} Stirling1(n, k)*FallingFactorial(x, k), triangle read by rows, for n >= 0 and 0 <= k <= n.at n=40A325872
- Number of nX4 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=4A326101
- Number of nX5 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=3A326102
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=31A326105
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=32A326105
- a(n) = Sum_{k=n..2*n} |Stirling1(2*n, k) * Stirling1(k, n)|.at n=4A341589
- a(n) is the least number that is the sum of two cubes of primes and is 2^n times an odd number.at n=6A359448