926100

Appears in sequences

• a(n) is the smallest number representable in exactly n ways as a sum of 2 powerful(1) numbers.at n=31A115354
• G.f.: Sum_{n>=0} R_n(x+x*y) * x^(2*n)*y^n / (1-x-x*y)^(4*n+1) = Sum_{n>=0} Sum_{k=0..n} C(n,k)^4 * x^n*y^k, where R_n(x+x*y) equals the n-th row polynomial R_n(z) = Sum_{k=0..2*n} T(n,k)*z^k at z = x+x*y.at n=33A248600
• Array read by antidiagonals: T(n,k) = n^3*k^3*(n+k)^2, n>=1, k>=1.at n=38A358293
• Array read by antidiagonals: T(n,k) = n^3*k^3*(n+k)^2, n>=1, k>=1.at n=42A358293
• Triangle read by rows: T(n,k) = n^3*k^3*(n+k)^2, n>=0, 0 <= k <= n.at n=31A358294
• Triangle read by rows: T(n,k) = n^3*k^3*(n+k)^2, n>=1, 1 <= k <= n.at n=23A358295