40636

Appears in sequences

• Define an array as follows: b(i,0)=b(0,j)=1, b(i,j) = 2*b(i-1,j-1) + b(i-1,j) + b(i,j-1). Then a(n) = b(n,n).at n=6A069835
• Second binomial transform of binomial(n+6, 6).at n=6A081904
• A scaled Legendre triangle.at n=38A110124
• a(n) = {n^2}_n.at n=33A122635
• Number of 14X2 integer matrices with each row summing to zero, row elements in nondecreasing order, rows in lexicographically nondecreasing order, and the sum of squares of the elements <= 2*n^2 (number of collections of 14 zero-sum 2-vectors with total modulus squared not more than 2*n^2, ignoring vector and component permutations).at n=12A192715
• Number of partitions p of n such that (number of even numbers in p) <= 2*(number of odd numbers in p).at n=41A241642
• Triangle read by rows: T(n,0) = 0 for n >= 0; T(n,2*k+1) = A152842(2*n,2*(n-k)) and T(n,2*k) = A152842(2*n,2*(n-k)+1) for n >= k > 0.at n=49A299989
• Square array read by descending antidiagonals: T(n, k) where column k is the expansion of 1/sqrt(1 - 2*(k+1)*x + ((k-1)*x)^2).at n=51A307883
• a(n) = 8^n * P(3*n, n), where P(n, x) is n-th Legendre polynomial.at n=2A349113
• Indices where the cumulative sum of cos(2k+1)^(2k+1) reaches a record high value.at n=35A389559