The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A095422 Triangle read by rows: T(n,m) = number of m-block proper T_0-covers (without empty blocks and without multiple blocks) of a labeled n-set (n>=2, 2<=m<=2^n-2). 2
 1, 3, 17, 15, 6, 1, 0, 128, 771, 1882, 2969, 3428, 3003, 2002, 1001, 364, 91, 14, 1, 0, 420, 12845, 108731, 539105, 1969355, 5790720, 14262105, 30019990, 54616835, 86490040, 119759185, 145422590, 155117515, 145422675, 119759850, 86493225 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,2 LINKS FORMULA T(n, m) = Sum(Stirling1(n+1, i+1)*binomial(2^i-1, m)-Stirling1(n, i)*binomial(2^i-2, m-1), i=1..n). EXAMPLE 1; 3,17,15,6,1; 0,128,771,1882,2969,3428,3003,2002,1001,364,91,14,1; ... CROSSREFS Cf. A095423(row sums), A095421. Sequence in context: A087964 A174182 A120448 * A195999 A059189 A043066 Adjacent sequences:  A095419 A095420 A095421 * A095423 A095424 A095425 KEYWORD nonn,tabf AUTHOR Goran Kilibarda, Vladeta Jovovic, Jun 04 2004 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 29 06:21 EDT 2021. Contains 346340 sequences. (Running on oeis4.)