41580

Appears in sequences

• Expansion of (1+2*x+x^2)/(1-34*x+x^2).at n=3A004294
• Number of n-step walks on square lattice in the first quadrant which finish at distance n-3 from the x-axis.at n=41A005564
• Area of more than one Pythagorean triangle.at n=31A009127
• Let a,b,c,...k be all divisors of n; a(n) = (a+1)*(b+1)*...*(k+1).at n=19A020696
• a(n) = 5*(n+1)*binomial(n+4,6).at n=6A027802
• a(n) = 21*(n+1)*binomial(n+4,9).at n=3A027805
• a(n) = Product_{i=1..n} ((i+3)*(i+4)*(i+5))/(i*(i+1)*(i+2)).at n=6A047819
• Number of nonempty subsets of {1,2,...,n} in which exactly 4/5 of the elements are <= (n+1)/3.at n=31A048046
• Number of nonempty subsets of {1,2,...,n} in which exactly 4/5 of the elements are <= (n+2)/3.at n=31A048079
• Number of nonempty subsets of {1,2,...,n} in which exactly 4/5 of the elements are <= (n+3)/3.at n=31A048090
• a(n) = n*(n+1)*(2*n+1).at n=27A055112
• Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <= m, columns <= n and entries <= 3.at n=48A056939
• Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <= m, columns <= n and entries <= 3.at n=51A056939
• Smallest number whose set of divisors contains each digit 0-9 at least n times.at n=15A059436
• Smallest number whose set of divisors contains each digit 0-9 at least n times.at n=14A059436
• Smallest number whose set of divisors contains each digit 0-9 at least n times.at n=16A059436
• Triangle read by rows, T(n, k) = binomial(n, k)*binomial(n + 2, k).at n=49A062196
• Triangle of coefficients of Bessel polynomials {y_n(x)}'.at n=38A065931
• Triangle of coefficients of Bessel polynomials {y_n(x)}''.at n=30A065943
• Bessel polynomial {y_n}'''(0).at n=8A065949