411840

Appears in sequences

• a(n) = binomial(2*n+1,n)*(n+1)^2.at n=7A002544
• Number of spanning trees of quarter Aztec diamonds of order n.at n=5A007726
• Ninth column of Lanczos triangle A053125 (decreasing powers).at n=3A054327
• T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.at n=52A063007
• Triangle of coefficients of Bateman polynomial n!Z_n(-x).at n=43A073768
• First subdiagonal of number array A082137.at n=7A082143
• Triangle: row #n has n+1 terms. T(n,m) = 4^m (2n+1)! / ( (2n-2m)! (2m+1)! ).at n=31A085841
• a(n) = binomial(n+7,7)*binomial(n+11,7).at n=3A104476
• Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,1) (i.e., bilateral Schroeder paths), having k D=(1,1) steps.at n=47A104684
• a(n) = binomial(n+3,n)*binomial(n+7,n).at n=7A105250
• a(n) = C(n+2,2)*C(n,floor(n/2)).at n=14A107231
• Irregular triangle, read by rows, T(n, k) = binomial(2*n, k)*binomial(2*k, k).at n=32A156789
• G.f. satisfies: A(x) = Sum_{n>=0} A_n(x) * A(x)^n where A_{n+1}(x) = A_n(A(x)) denotes iteration with A_0(x)=x and A'(0)=1.at n=9A180256
• Smallest k such that the partial sums of the divisors of k (taken in increasing order) contain exactly n primes.at n=25A187822
• 5-quantum transitions in systems of N>=5 spin 1/2 particles, in columns by combination indices.at n=22A213347
• Record values of gcd(sigma(n), phi(n)) (A009223).at n=43A222712
• Triangle read by rows: T(n,k) = binomial(2*n,k)*Stirling2(2*n-k,n).at n=43A226703
• G.f.: A(x,y) = Sum_{n>=0} exp(-y/(1-n*x)) * y^n/(1-n*x)^n / n!.at n=53A245111
• Highly composite numbers of class 6 (see comment in A275239).at n=29A275244
• Solutions y to the negative Pell equation y^2 = 72*x^2 - 1331712 with x,y >= 0.at n=11A281242