Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A085734
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A085734 Triangle read by rows: T(0,0) = 1, T(n,k) = sum(j=max(0,1-k) to n-k, (2^j)*(C(k+j,1+j) + C(k+j+1,1+j))*T(n-1,k-1+j)). +0
4
1, 2, 3, 16, 30, 15, 272, 588, 420, 105, 7936, 18960, 16380, 6300, 945, 353792, 911328, 893640, 429660, 103950, 10395, 22368256, 61152000, 65825760, 36636600, 11351340, 1891890, 135135, 1903757312, 5464904448, 6327135360, 3918554640 (list; table; graph; listen)
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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research