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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A099755 Triangle read by rows: T(n,0)=1, T(n,n)=(2*n-1)!!+1, T(m,n)=2*(m-n)*T(m-1,n-1)+(2*n+2)*T(m-1,n). 0
1, 1, 2, 1, 10, 4, 1, 44, 44, 16, 1, 182, 440, 216, 106, 1, 736, 3732, 3488, 1492, 946, 1, 2954, 28280, 50296, 28872, 14336, 10396, 1, 11828, 199220, 628608, 590496, 287520, 174216, 135136, 1, 47326, 1337256, 7021064, 10933824, 6993216, 3589104, 2510608 (list; table; graph; refs; listen; history; internal format)
OFFSET

0,3

FORMULA

Sum(k=0..n: T(n, k))=(2*k+1)!! ==2*k+1)*(2*k-1)*(2*k-3)*...

EXAMPLE

Triangle begins:

1

1 2

1 10 4

1 44 44 16

1 182 440 216 106

MAPLE

T:=proc(n, k) if k=0 then 1 elif n=k then 1+(2*k)!/(k!*2^k) elif k>n then 0 else 2*(n-k)*T(n-1, k-1)+(2*k+2)*T(n-1, k) fi end: for n from 0 to 9 do [seq(T(n, k), k=0..n)] od;

CROSSREFS

Cf. A060187.

Sequence in context: A011268 A163235 A142963 * A202483 A110682 A110327

Adjacent sequences:  A099752 A099753 A099754 * A099756 A099757 A099758

KEYWORD

easy,nonn,tabl

AUTHOR

Miklos Kristof (kristmikl(AT)freemail.hu), Nov 11 2004

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 17 19:07 EST 2012. Contains 206085 sequences.