41405

Appears in sequences

• a(n) = Sum_{k=1..n-1} k^2*sigma(k)*sigma(n-k).at n=12A000477
• a(n) = n^2*(n+1)^2*(n+2)/12.at n=13A004302
• a(n) = binomial(n,3)*binomial(n-1,3)/4.at n=11A006542
• a(n) = floor(n/2) * floor((n-1)/2) * floor((n-2)/2) * floor((n-3)/2) * floor((n-4)/2) / 12.at n=30A028725
• Numbers n such that A001414(n) = sum of composites from the smallest prime factor of n to the largest prime factor of n.at n=20A074053
• In triangular peg solitaire, number of distinct feasible pairs starting with one peg missing and finishing with one peg.at n=39A130515
• In triangular peg solitaire, number of distinct solvable feasible pairs starting with one peg missing and finishing with one peg.at n=39A130516
• Number of 2 X 11 matrices with elements in 0..n with each row and each column in nondecreasing order. 2,11,n can be permuted, see formula.at n=3A140934
• Number of 3 X 11 matrices with elements in 0..n with each row and each column in nondecreasing order.at n=2A140935
• Records in A071786.at n=47A151766
• The Gi1 and Gi2 sums of Losanitsch's triangle A034851.at n=37A192928
• Number of standard Young tableaux with shapes corresponding to partitions into distinct parts with minimal difference 2.at n=14A225121
• Numbers that are multiple-digit narcissistic numbers in exactly four bases.at n=4A256363
• Number of ternary strings of length n that contain at least one 0 and at most two 1's.at n=11A338229
• Triangle read by rows: T(n,k) = generalized binomial coefficients (n,k)_11 (n >= 0, 0 <= k <= n).at n=17A342890
• Triangle read by rows: T(n,k) = generalized binomial coefficients (n,k)_11 (n >= 0, 0 <= k <= n).at n=18A342890
• G.f. A(x,y) satisfies: x*y*A(x,y) = Sum_{n=-oo..+oo} (-1)^n * x^(n*(n+1)/2) * A(x,y)^n, with coefficients T(n,k) of x^n*y^k in A(x,y) given as a triangle read by rows.at n=40A355360
• Central terms of A355360; a(n) = A355360(2*n,n).at n=4A355365
• Coefficients T(n,k) of x^(4*n+1-k)*y^k in A(x,y) for n >= 0, k = 0..3*n+1, where A(x,y) satisfies: y = Sum_{n=-oo..+oo} (-x)^(n^2) * A(x,y)^((n-1)^2), as an irregular triangle read by rows.at n=30A356501
• Triangle read by rows. T(n, k) = (n - k + 1) * binomial(n + k + 1, 2*k)^2 / (n + k + 1).at n=42A370233