140601

Appears in sequences

• a(n) = A027082(n, 2n-2).at n=11A027089
• a(n) = greatest number in row n of array T given by A027082.at n=13A027102
• a(n) = Sum_{k=0..n} Fibonacci(n-k)*n^k.at n=7A101220
• G.f.: Sum_{n>=0} x^n * (1+x)^(n^2).at n=10A121689
• Degree of denominator of GF for number of ways to place k nonattacking queens on an n X n board.at n=13A178717
• G.f.: A(x,y) = Sum_{n>=0} x^n * ((1+x)^n + y)^n, where A(0) = 0, as a triangle of coefficients T(n,k) of x^n*y^k in A(x,y) = Sum_{n>=0} x^n * Sum_{k=0..n} T(n,k)*x^n*y^k, read by rows.at n=55A325580