|
Search: id:A090011
|
|
|
| A090011 |
|
T(n,k) = number of partitions of binomial(n,k), 0<=k<=n, triangular array read by rows. |
|
+0
1
|
|
| 1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 5, 11, 5, 1, 1, 7, 42, 42, 7, 1, 1, 11, 176, 627, 176, 11, 1, 1, 15, 792, 14883, 14883, 792, 15, 1, 1, 22, 3718, 526823, 4087968, 526823, 3718, 22, 1, 1, 30, 17977, 26543660, 3519222692, 3519222692, 2, 6543660, 17977, 1, 1, 42, 89134
(list; table; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
COMMENT
|
a(n) = A000041(A007318(n));
T(n,0) = T(n,n) = 1; T(n,1) = T(n,n-1) = A000041(n), n>0.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Partition
Eric Weisstein's World of Mathematics, Binomial Coefficient
|
|
CROSSREFS
|
Adjacent sequences: A090008 A090009 A090010 this_sequence A090012 A090013 A090014
Sequence in context: A089980 A128545 A034364 this_sequence A061554 A088326 A124975
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Jan 28 2004
|
|
|
Search completed in 0.002 seconds
|
