222264
domain: N
Appears in sequences
- Triangle read by rows, defined by T(n,k) = C(n,k)*S2(n,k), 0 <= k <= n, where C(n,k) are the binomial coefficients and S2(n,k) are the Stirling numbers of the second kind.at n=51A090683
- Numbers with prime factorization p^3*q^3*r^4 where p, q, and r are distinct primes.at n=4A190472
- Triangle read by rows: T(n,k) is the number of stretching pairs in all permutations in S_{n,k} (=set of permutations in S_n with k cycles) (n >= 3; 1 <= k <= n-2).at n=22A216118
- Numbers whose square is both a sum and a difference of two positive cubes.at n=31A230716
- Numbers of multiplicative persistence 5 which are themselves the product of digits of a number.at n=4A350184
- Array read by antidiagonals: T(n,k) = n^3*k^3*(n+k)^2, n>=0, k>=0.at n=47A358292
- Array read by antidiagonals: T(n,k) = n^3*k^3*(n+k)^2, n>=0, k>=0.at n=52A358292
- Array read by antidiagonals: T(n,k) = n^3*k^3*(n+k)^2, n>=1, k>=1.at n=29A358293
- Array read by antidiagonals: T(n,k) = n^3*k^3*(n+k)^2, n>=1, k>=1.at n=34A358293
- Triangle read by rows: T(n,k) = n^3*k^3*(n+k)^2, n>=0, 0 <= k <= n.at n=30A358294
- Triangle read by rows: T(n,k) = n^3*k^3*(n+k)^2, n>=1, 1 <= k <= n.at n=22A358295
- Triangle read by rows, T(n, k) = [x^k] p(n), where p(n) = hypergeom([1/2, -n - 1, -n], [2, 2], 4*x).at n=50A367023
- Triangle read by rows, T(n, k) = [x^k] p(n), where p(n) = (1 - hypergeom([-1/2, -n - 1, -n - 1], [1, 1], 4*x)) / (2*x).at n=40A367025
- Triangle read by rows. T(n, k) = binomial(n, k)^2 * CatalanNumber(k).at n=49A367178
- Cubefull numbers with more than 2 distinct prime factors.at n=9A391755