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-1} T(n,k) * T(n,k+1), with T given by A026659.
0

%I #8 Oct 20 2019 19:49:20

%S 1,4,24,90,365,1376,7365,28002,121049,465004,2437089,9396986,41758527,

%T 162167568,842470494,3277804402,14798196587,57865149612,299015494394,

%U 1170434872374,5339682500573,20979019813768,107997589923134,424558473013940,1951503161793927,7693926097133316

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

%K nonn

%O 1,2

%A _Clark Kimberling_

%E More term from _Sean A. Irvine_, Oct 20 2019