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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A208653 a(n) = Product_{i=floor((n + 1)/2)..n-1} binomial(n-1, i). 4

%I #10 Feb 01 2022 17:16:26

%S 1,1,1,3,4,50,90,5145,12544,3429216,11340000,15219319500,68309049600,

%T 457937132487120,2790771598030416,94609025993497640625,

%U 783056974947287040000,135476575389769051389952000,1523136299736565293430210560,1354434926051634531310373234715648

%N a(n) = Product_{i=floor((n + 1)/2)..n-1} binomial(n-1, i).

%C Used with A208652 to count palindromic paths for A208654.

%t m[n_]:=Floor[(n+1)/2]; z=21;

%t h[n_]:=Product[Binomial[n-1,i],{i,m[n],n-1}]

%t Table[h[n],{n,1,z}] (* A208653 *)

%Y Cf. A208652, A208654.

%K nonn

%O 1,4

%A _Clark Kimberling_, Mar 02 2012

%E Definition corrected by _Georg Fischer_, Feb 01 2022

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 April 15 12:14 EDT 2024. Contains 371681 sequences. (Running on oeis4.)