Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133721
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133721 Triangle read by rows: T(m,n) = number of n-balanced and minimal labeled covers of a finite set of m unlabeled elements (m >= 1, 1 <= n <= m). +0
5
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 6, 7, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 10, 1, 13, 1, 1, 1, 1, 1, 1, 1, 25, 7, 1, 1, 1, 1, 1, 1, 1, 15, 6, 3, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 13, 1, 1, 1, 1, 1, 1, 1, 1, 21, 65, 81, 7, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 10 (list; table; graph; listen)
OFFSET

1,12

REFERENCES

A. P. Burger and J. H. van Vuuren, Balanced minimal covers of a finite set, Discr. Math. 307 (2007), 2853-2860.

EXAMPLE

Triangle begins:

1

1 1

1 1 1

1 1 1 1

1 3 1 1 1

1 1 1 1 1 1

1 6 7 1 1 1 1

1 1 3 1 1 1 1 1

1 10 1 13 1 1 1 1 1

1 1 25 7 1 1 1 1 1 1

1 15 6 3 22 1 1 1 1 1 1

CROSSREFS

Cf. A133709. Column n=2 is essentially A000217. Columns 3, 4, 5, 6 give A133722, A133723, A133724, A133733.

Sequence in context: A030577 A070670 A049586 this_sequence A083202 A030560 A030559

Adjacent sequences: A133718 A133719 A133720 this_sequence A133722 A133723 A133724

KEYWORD

nonn,tabl

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Dec 30 2007

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 17 19:39 EST 2009. Contains 170821 sequences.


AT&T Labs Research