Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A094440
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A094440 Triangular array T(n,k)=F(n+1-k)C(n,k-1), k=1,2,3,...,n; n>=1. +0
6
1, 1, 2, 2, 3, 3, 3, 8, 6, 4, 5, 15, 20, 10, 5, 8, 30, 45, 40, 15, 6, 13, 56, 105, 105, 70, 21, 7, 21, 104, 224, 280, 210, 112, 28, 8, 34, 189, 468, 672, 630, 378, 168, 36, 9, 55, 340, 945, 1560, 1680, 1260, 630, 240, 45, 10, 89, 605, 1870, 3465, 4290, 3696, 2310, 990, 330 (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 December 21 10:15 EST 2009. Contains 171081 sequences.


AT&T Labs Research