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.

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.

This page as a plain text file.
%I A058793 #10 Jan 29 2020 20:34:04
%S A058793 1,6,73,2957,431805,193413963,198914729182,389238347659505,
%T A058793 1292594846197639190,6753309741099683530616
%N 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.
%C A058793 Cover may include multiple occurrences of a subset. Also n-rowed binary matrices with distinct rows and all row sums 6.
%H A058793 Vladeta Jovovic, <a href="/A058790/a058790.pdf">Formula</a>
%Y A058793 Row n=6 of A331508.
%Y A058793 Cf. A050535, A050913, A058783, A058784, A058785.
%K A058793 more,nonn
%O A058793 1,2
%A A058793 _Vladeta Jovovic_, Nov 30 2000
%E A058793 a(6)-a(10) from _Andrew Howroyd_, Jan 29 2020