Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A058793
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A058793 Number of covers of an unlabeled n-set such that every point of the set is covered by exactly 6 subsets of the cover and that intersection of every 6 subsets of the cover contains at most one point. +0
1
1, 6, 73, 2957, 431805 (list; graph; listen)
OFFSET

1,2

COMMENT

Cover may include multiple occurrences of a subset. Also n-rowed binary matrices with distinct rows and all row sums 6.

LINKS

Formula

CROSSREFS

Cf. A050535, A050913, A058783-A058785.

Sequence in context: A041060 A089926 A135594 this_sequence A066171 A057783 A069852

Adjacent sequences: A058790 A058791 A058792 this_sequence A058794 A058795 A058796

KEYWORD

more,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)Eunet.yu), Nov 30 2000

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research