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!)
A114162 C(n,k)*Floor((n-k)/2)!. 0

%I #5 Jan 06 2024 21:49:23

%S 1,1,1,1,2,1,1,3,3,1,2,4,6,4,1,2,10,10,10,5,1,6,12,30,20,15,6,1,6,42,

%T 42,70,35,21,7,1,24,48,168,112,140,56,28,8,1,24,216,216,504,252,252,

%U 84,36,9,1,120,240,1080,720,1260,504,420,120,45,10,1

%N C(n,k)*Floor((n-k)/2)!.

%C Row sums are A081124.

%F T(n, k) = if(k<=n, C(n, k)floor((n-k)/2)!, 0).

%e Triangle begins:

%e 1;

%e 1, 1;

%e 1, 2, 1;

%e 1, 3, 3, 1;

%e 2, 4, 6, 4, 1;

%e 2, 10, 10, 10, 5, 1;

%e 6, 12, 30, 20, 15, 6, 1;

%e 6, 42, 42, 70, 35, 21, 7, 1;

%Y Cf. A081124.

%K easy,nonn,tabl

%O 0,5

%A _Paul Barry_, Nov 14 2005

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 September 16 18:24 EDT 2024. Contains 375977 sequences. (Running on oeis4.)