Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099759
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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). +0
2
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; listen)
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.

Adjacent sequences: A099756 A099757 A099758 this_sequence A099760 A099761 A099762

Sequence in context: A101919 A055106 A080416 this_sequence A072590 A111636 A051433

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research