cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

This page as a plain text file.
%I A058792 #13 Aug 27 2022 03:37:16
%S A058792 1,5,44,966,53535,7043925,1775617861,738134963014,461550358993886,
%T A058792 409321620633426443,493892363593918906465
%N 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.
%C A058792 Cover may include multiple occurrences of a subset. Also n-rowed binary matrices with distinct rows and all row sums 5.
%H A058792 Vladeta Jovovic, <a href="/A058790/a058790.pdf">Formula</a>
%Y A058792 Row n=5 of A331508.
%Y A058792 Cf. A050535, A050913, A058783, A058784, A058785.
%K A058792 more,nonn
%O A058792 1,2
%A A058792 _Vladeta Jovovic_, Nov 30 2000
%E A058792 a(7)-a(10) from _Andrew Howroyd_, Jan 29 2020
%E A058792 a(11) from _Sean A. Irvine_, Aug 27 2022