This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A027113 Triangular array T given by rows: T(n,0)=1 for n >= 0, T(n,1)=1,T(n,2)=2 for n >= 1 and for n >= 2, T(n,k)=T(n-1,k-3)+T(n-1,k-2)+T(n-1,k-1) for 3<=k<=2n-1, T(n,2n)=T(n-1,2n-3)+T(n-1,2n-2). 31

%I

%S 1,1,1,2,1,1,2,4,3,1,1,2,4,7,9,7,1,1,2,4,7,13,20,23,16,1,1,2,4,7,13,

%T 24,40,56,59,39,1,1,2,4,7,13,24,44,77,120,155,154,98,1,1,2,4,7,13,24,

%U 44,81,145,241,352,429,407,252,1,1,2,4,7,13,24

%N Triangular array T given by rows: T(n,0)=1 for n >= 0, T(n,1)=1,T(n,2)=2 for n >= 1 and for n >= 2, T(n,k)=T(n-1,k-3)+T(n-1,k-2)+T(n-1,k-1) for 3<=k<=2n-1, T(n,2n)=T(n-1,2n-3)+T(n-1,2n-2).

%C The rows are of lengths 1, 3, 5, 7, ...

%e 1; 1,1,2; 1,1,2,4,3; 1,1,2,4,7,9,7; 1,1,2,4,7,13,20,23,16; ...

%K nonn,tabf

%O 1,4

%A _Clark Kimberling_

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

Last modified January 17 16:11 EST 2019. Contains 319235 sequences. (Running on oeis4.)