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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A057669 Triangle T(n,k) of number of minimal 3-covers of an unlabeled n+3-set that cover k points of that set uniquely (k=3,..,n+3). 10
 1, 2, 1, 4, 3, 2, 7, 7, 6, 3, 11, 13, 14, 9, 4, 16, 22, 26, 21, 13, 5, 23, 34, 44, 40, 31, 17, 7, 31, 50, 68, 68, 59, 41, 23, 8, 41, 70, 100, 106, 101, 79, 55, 28, 10, 53, 95, 140, 157, 158, 136, 106, 68, 35, 12, 67, 125, 190, 221, 234, 214, 182, 132, 85, 42, 14, 83, 161 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Row sums give A005783. LINKS Table of n, a(n) for n=0..67. V. Jovovic, More information FORMULA T(n, k) = b(n, k)-b(n-1, k); b(n, k) = coefficient of x^k in x^3/6*(Z(S_n; 5+3*x, 5+3*x^2, ...)+3*Z(S_n; 3+x, 5+3*x^2, 3+x^3, 5+3*x^4, ...)+2*Z(S_n; 2, 2, 5+3*x^3, 2, 2, 5+3*x^6, ...)), where Z(S_n; x_1, x_2, ..., x_n) is cycle index of symmetric group S_n of degree n. EXAMPLE [1], [2, 1], [4, 3, 2], [7, 7, 6, 3], ... There are 7 minimal 3-covers of an unlabeled 6-set that cover 3 points of that set uniquely: {{1}, {2, 4, 5, 6}, {3, 4, 5, 6}}, {{1, 6}, {2, 4, 5}, {3, 4, 5, 6}}, {(1, 6}, {2, 4, 5, 6}, {3, 4, 5, 6}}, {{1, 5, 6}, {2, 4, 6}, {3, 4, 5}}, {{1, 5, 6}, {2, 4, 6}, {3, 4, 5, 6}}, {{1, 5, 6}, {2, 4, 5, 6}, {3, 4, 5, 6}}, {{1, 4, 5, 6}, {2, 4, 5, 6}, {3, 4, 5, 6}}. CROSSREFS Cf. A001752, A056885, A057222, A057223, A057524. Sequence in context: A144330 A141155 A204922 * A243610 A182013 A144333 Adjacent sequences: A057666 A057667 A057668 * A057670 A057671 A057672 KEYWORD nonn,tabl AUTHOR Vladeta Jovovic, Oct 16 2000 STATUS approved

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.

Last modified July 14 05:06 EDT 2024. Contains 374291 sequences. (Running on oeis4.)