The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A026993 a(n) = Sum_{k=0..n-2} T(n,k) * T(n,k+2), with T given by A026692. 0

%I #11 Jul 28 2022 21:40:42

%S 1,6,32,180,984,4606,22689,114992,567129,2576582,12586319,63131004,

%T 305635176,1384074886,6739962365,33708050180,162468169385,

%U 737652413014,3588021213950,17917172173846,86273708463456,393163075111278,1911781914938634,9536792007640980,45924386118166540

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

%Y Cf. A026692.

%K nonn

%O 2,2

%A _Clark Kimberling_

%E More terms from _Sean A. Irvine_, Oct 21 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 3 02:48 EST 2023. Contains 367530 sequences. (Running on oeis4.)