The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A094631 Number of n-block 3-uniform T_0-covers. 4
 1, 0, 0, 184, 16936, 2711904, 675457000, 232383728378, 105676839790294, 61466235823794521, 44524673319233300950, 39314601406037457009543, 41574584860907056125473119, 51879840704758774687928224799, 75441055286834286248687362255451, 126462548502721304612260672370098185 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS a(n) is the number of binary matrices with n distinct columns and any number of distinct nonzero rows with 3 ones in every column and columns in decreasing lexicographic order. - Andrew Howroyd, Jan 25 2020 LINKS Andrew Howroyd, Table of n, a(n) for n = 0..100 CROSSREFS Row n=3 of A331569. Cf. A094630, A059530, A060070. Sequence in context: A221782 A296780 A035831 * A060491 A203843 A151586 Adjacent sequences:  A094628 A094629 A094630 * A094632 A094633 A094634 KEYWORD nonn AUTHOR Goran Kilibarda, Vladeta Jovovic, May 15 2004 EXTENSIONS Terms a(11) and beyond from Andrew Howroyd, Jan 25 2020 STATUS approved

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

Last modified December 5 10:11 EST 2021. Contains 349543 sequences. (Running on oeis4.)