login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(n) = Sum_{k=0..n} T(n,k) * T(n,2n-k), with T given by A027082.
0

%I #8 Oct 23 2019 20:08:25

%S 1,2,6,25,93,357,1373,5188,19456,72373,267137,979762,3573058,12965292,

%T 46839228,168552205,604420933,2160638253,7701879217,27384190634,

%U 97138835970,343846037094,1214761031998,4283924048755

%N a(n) = Sum_{k=0..n} T(n,k) * T(n,2n-k), with T given by A027082.

%K nonn

%O 0,2

%A _Clark Kimberling_