login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A058792 Number of covers of an unlabeled n-set such that every point of the set is covered by exactly 5 subsets of the cover and that intersection of every 5 subsets of the cover contains at most one point. 1

%I #13 Aug 27 2022 03:37:16

%S 1,5,44,966,53535,7043925,1775617861,738134963014,461550358993886,

%T 409321620633426443,493892363593918906465

%N Number of covers of an unlabeled n-set such that every point of the set is covered by exactly 5 subsets of the cover and that intersection of every 5 subsets of the cover contains at most one point.

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

%H Vladeta Jovovic, <a href="/A058790/a058790.pdf">Formula</a>

%Y Row n=5 of A331508.

%Y Cf. A050535, A050913, A058783, A058784, A058785.

%K more,nonn

%O 1,2

%A _Vladeta Jovovic_, Nov 30 2000

%E a(7)-a(10) from _Andrew Howroyd_, Jan 29 2020

%E a(11) from _Sean A. Irvine_, Aug 27 2022

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 02:10 EDT 2024. Contains 371782 sequences. (Running on oeis4.)