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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A027295 a(n) = Sum_{k=0..m-1} T(n,k) * T(n,k+1), where m=n for n=0,1 and m=floor((n+3)/2) for n >= 2, and T given by A026022. 0

%I

%S 1,4,15,52,195,676,2555,8976,34098,121448,463067,1669340,6384287,

%T 23251620,89157557,327523680,1258803182,4658150520,17940605163,

%U 66803546472,257777882894,965023761064,3730202020650,14029655954272,54315578806820,205120107930192

%N a(n) = Sum_{k=0..m-1} T(n,k) * T(n,k+1), where m=n for n=0,1 and m=floor((n+3)/2) for n >= 2, and T given by A026022.

%K nonn

%O 1,2

%A _Clark Kimberling_

%E More terms from _Sean A. Irvine_, Oct 26 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 13:07 EDT 2023. Contains 361599 sequences. (Running on oeis4.)