# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a095422
Showing 1-1 of 1

%I A095422 #5 May 10 2013 12:45:34
%S A095422 1,3,17,15,6,1,0,128,771,1882,2969,3428,3003,2002,1001,364,91,14,1,0,
%T A095422 420,12845,108731,539105,1969355,5790720,14262105,30019990,54616835,
%U A095422 86490040,119759185,145422590,155117515,145422675,119759850,86493225
%N 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).
%F A095422 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).
%e A095422 1; 3,17,15,6,1; 0,128,771,1882,2969,3428,3003,2002,1001,364,91,14,1; ...
%Y A095422 Cf. A095423(row sums), A095421.
%K A095422 nonn,tabf
%O A095422 2,2
%A A095422 Goran Kilibarda, _Vladeta Jovovic_, Jun 04 2004

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE