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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A099759 Triangle read by rows: T(n,0)=1, T(n,n)=1 T(m,n)=2*(m-n)*T(m-1,n-1)+2*n*T(m-1,n). 1
1, 1, 1, 1, 4, 1, 1, 12, 12, 1, 1, 30, 96, 30, 1, 1, 68, 564, 564, 68, 1, 1, 146, 2800, 6768, 2800, 146, 1, 1, 304, 12660, 63008, 63008, 12660, 304, 1, 1, 622, 54288, 504648, 1008128, 504648, 54288, 622, 1, 1, 1260, 225860, 3679344, 13111504, 13111504 (list; table; graph; refs; listen; history; internal format)
OFFSET

0,5

FORMULA

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

EXAMPLE

Triangle begins:

1

1 1

1 4 1

1 12 12 1

1 30 96 30 1

1 68 564 564 68 1

MAPLE

T:=proc(n, k) if k=0 or n=k then 1 elif k>n then 0 else 2*(n-k)*T(n-1, k-1)+2*k*T(n-1, k) fi end: for n from 0 to 10 do [seq(T(n, k), k=0..n)] od; # gives the triangle row by row (Deutsch)

CROSSREFS

Cf. A060187, A099760.

Sequence in context: A154372 A080416 A168619 * A072590 A111636 A146990

Adjacent sequences:  A099756 A099757 A099758 * A099760 A099761 A099762

KEYWORD

easy,tabl,nonn

AUTHOR

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

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Nov 16 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 14 09:48 EST 2012. Contains 205614 sequences.