login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A114162 C(n,k)*Floor((n-k)/2)!. 0
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, 42, 70, 35, 21, 7, 1, 24, 48, 168, 112, 140, 56, 28, 8, 1, 24, 216, 216, 504, 252, 252, 84, 36, 9, 1, 120, 240, 1080, 720, 1260, 504, 420, 120, 45, 10, 1 (list; table; graph; refs; listen; history; internal format)
OFFSET

0,5

COMMENTS

Row sums are A081124.

FORMULA

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

EXAMPLE

Triangle begins

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, 42, 70, 35, 21, 7, 1;

CROSSREFS

Sequence in context: A056670 A170925 A030189 * A162981 A029264 A124054

Adjacent sequences:  A114159 A114160 A114161 * A114163 A114164 A114165

KEYWORD

easy,nonn,tabl

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Nov 14 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 07:40 EST 2012. Contains 205715 sequences.