Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A095422
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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). +0
3
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; listen)
OFFSET

2,2

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.

Adjacent sequences: A095419 A095420 A095421 this_sequence A095423 A095424 A095425

Sequence in context: A088122 A087964 A120448 this_sequence A059189 A043066 A101144

KEYWORD

nonn,tabf

AUTHOR

Goran Kilibarda, Vladeta Jovovic (vladeta(AT)Eunet.yu), Jun 04 2004

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 October 13 09:05 EDT 2008. Contains 145008 sequences.


AT&T Labs Research