134964

Appears in sequences

• a(n) = Sum_{k=0..n} f(k)*f(n-k) where f(k) = A002124(k).at n=43A002125
• Numbers k that divide the sum of the digits of k!!, the double factorial of k.at n=23A108858
• Square array where T(n,k) = Sum_{j=0..k} C(n+2*j,j)*C(n+2*j,k-j), read by antidiagonals.at n=52A137634
• a(n) = Sum_{k=0..n} C(2k+2,k)*C(2k+2,n-k) ; equals row 2 of square array A137634 ; also equals the convolution of A137635 and the self-convolution of A073157.at n=7A137637
• Triangle read by rows: T(n,k) is the number of (unlabeled) connected graphs with n nodes such that k is the maximum number that can be reached when the stepping stone puzzle of A337663 is played on the graph, 1 <= k <= n.at n=53A350785