A060484 -id:A060484 - cp's OEIS frontend

A060487 Triangle T(n,k) of k-block tricoverings of an n-set (n >= 3, k >= 4).

1, 3, 1, 7, 57, 95, 43, 3, 35, 717, 3107, 4520, 2465, 445, 12, 155, 7845, 75835, 244035, 325890, 195215, 50825, 4710, 70, 651, 81333, 1653771, 10418070, 27074575, 33453959, 20891962, 6580070, 965965, 52430, 465

Offset: 3

Vladeta Jovovic, Mar 20 2001

A covering of a set is a tricovering if every element of the set is covered by exactly three blocks of the covering.

			Triangle begins:
  [1, 3, 1];
  [7, 57, 95, 43, 3];
  [35, 717, 3107, 4520, 2465, 445, 12];
  [155, 7845, 75835, 244035, 325890, 195215, 50825, 4710, 70];
  [651, 81333, 1653771, 10418070, 27074575, 33453959, 20891962, 6580070, 965965, 52430, 465];
   ...
There are 205 tricoverings of a 4-set(cf. A060486): 7 4-block, 57 5-block, 95 6-block, 43 7-block and 3 8-block tricoverings.

Andrew Howroyd, Table of n, a(n) for n = 3..1157

Columns include A060483, A060484, A060485.
Row sums are A060486.
Cf. A006095, A060090-A060095, A060069, A060070, A060051-A060053, A002718, A059443, A003462, A059945-A059951.

WeighT(v)={Vec(exp(x*Ser(dirmul(v, vector(#v, n, (-1)^(n-1)/n))))-1, -#v)}
D(p, n, k)={my(v=vector(n)); for(i=1, #p, v[p[i]]++); WeighT(v)[n]^k/prod(i=1, #v, i^v[i]*v[i]!)}
row(n, k)={my(m=n*k+1, q=Vec(exp(intformal(O(x^m) - x^n/(1-x)))/(y+x))); if(n==0, 1, (-1)^m*sum(j=0, m, my(s=0); forpart(p=j, s+=(-1)^#p*D(p, n, k), [1, n]); s*q[#q-j])*y^(m-n)/(1+y))}
for(n=3, 8, print(Vecrev(row(3,n)))); \\ Andrew Howroyd, Dec 23 2018

E.g.f. for k-block tricoverings of an n-set is exp(-x+x^2/2+(exp(y)-1)*x^3/3)*Sum_{k=0..inf}x^k/k!*exp(-1/2*x^2*exp(k*y))*exp(binomial(k, 3)*y).

A060483 Number of 5-block tricoverings of an n-set.

Original entry on oeis.org

3, 57, 717, 7845, 81333, 825237, 8300757, 83202645, 832809813, 8331237717, 83324947797, 833299785045, 8333199127893, 83332796486997, 833331185898837, 8333324743497045, 83333298973791573, 833333195894773077, 8333332783578305877, 83333331134311650645

Offset: 3

Vladeta Jovovic, Mar 20 2001

A covering of a set is a tricovering if every element of the set is covered by exactly three blocks of the covering.

Andrew Howroyd, Table of n, a(n) for n = 3..500
Index entries for linear recurrences with constant coefficients, signature (17,-84,148,-80).

Column k=5 of A060487.

Cf. A006095, A060484, A060485, A060486, A060090-A060095, A060069, A060070, A060051-A060053, A002718, A059443, A003462, A059945-A059951.

Vec(3*(1+2*x)/(x-1)/(2*x-1)/(4*x-1)/(10*x-1)+O(x^99)) \\ Charles R Greathouse IV, Jan 11 2013

a(n) = (1/5!)*(10^n - 15*4^n + 45*2^n - 40).
Generally, e.g.f. for k-block tricoverings of an n-set is exp(-x+x^2/2+(exp(y)-1)*x^3/3)*Sum_{k=0..inf}x^k/k!*exp(-1/2*x^2*exp(k*y))*exp(binomial(k, 3)*y).
G.f.: 3*x^3*(2*x+1) / ((x-1)*(2*x-1)*(4*x-1)*(10*x-1)). - Colin Barker, Jan 11 2013

More terms from Colin Barker, Jan 11 2013

A060485 Number of 7-block tricoverings of an n-set.

Original entry on oeis.org

43, 4520, 244035, 10418070, 401861943, 14778678180, 530817413155, 18837147108890, 664260814445943, 23345018969140440, 818942064306004275, 28699514624047140510, 1005201938765467579543, 35196266296400319440300

Offset: 4

Vladeta Jovovic, Mar 20 2001

A covering of a set is a tricovering if every element of the set is covered by exactly three blocks of the covering.

Andrew Howroyd, Table of n, a(n) for n = 4..200
Index entries for linear recurrences with constant coefficients, signature (110, -4991, 124120, -1887459, 18470550, -118758569, 501056740, -1355000500, 2223560000, -1973160000, 705600000).

Column k=7 of A060487.

Cf. A006095, A060483, A060484, A060486, A060090-A060095, A060069, A060070, A060051-A060053, A002718, A059443, A003462, A059945-A059951.

a(n) = (1/7!)*(35^n - 7*20^n - 21*15^n + 42*10^n + 105*8^n + 105*7^n + 70*5^n - 945*4^n - 525*3^n + 2450*2^n - 1470).
E.g.f. for k-block tricoverings of an n-set is exp(-x+x^2/2+(exp(y)-1)*x^3/3)*Sum_{k=0..infinity}x^k/k!*exp(-1/2*x^2*exp(k*y))*exp(binomial(k, 3)*y).
G.f.: x^4*(27300000*x^7 +9288000*x^6 -17908650*x^5 +6008735*x^4 -796380*x^3 +38552*x^2 +210*x -43) / ((x -1)*(2*x -1)*(3*x -1)*(4*x -1)*(5*x -1)*(7*x -1)*(8*x -1)*(10*x -1)*(15*x -1)*(20*x -1)*(35*x -1)). - Colin Barker, Jan 12 2013

A060490 Number of 6-block ordered tricoverings of an unlabeled n-set.

Original entry on oeis.org

0, 0, 120, 3030, 24552, 130740, 551640, 1997415, 6470420, 19219462, 53187840, 138658760, 343297780, 812249250, 1845669776, 4044119530, 8573706300, 17637474350, 35294157340, 68850086745, 131179071560, 244518601660, 446576824800, 800201972990, 1408466719120

Offset: 1

Vladeta Jovovic, Mar 20 2001

nonn

A covering of a set is a tricovering if every element of the set is covered by exactly three blocks of the covering.

Andrew Howroyd, Table of n, a(n) for n = 1..1000

Column k=6 of A060492.

Cf. A060094, A060484, A060491.

a(n) = binomial(n + 19, 19) - 6*binomial(n + 9, 9) - 15*binomial(n + 7, 7) + 135*binomial(n + 3, 3) - 310*binomial(n + 1, 1) + 240*binomial(n, 0) - 45*binomial(n - 1, -1).
G.f.: -y^3*( -78600*y^3 + 271080*y^4 - 120 - 630*y + 13248*y^2 - 635805*y^5 + 4300*y^15 - 15840*y^14 + 32760*y^13 - 18240*y^12 - 114120*y^11 + 442800*y^10 - 915315*y^9 - 1371804*y^7 + 1305540*y^8 + 1081360*y^6 + 45*y^17 - 660*y^16)/(-1 + y)^20.
E.g.f. for ordered k-block tricoverings of an unlabeled n-set is exp( -x + x^2/2 + x^3/3*y/(1 - y))*Sum_{k>=0} 1/(1 - y)^binomial(k, 3)*exp( -x^2/2*1/(1 - y)^n)*x^k/k!.

a(1)=a(2)=0 prepended and terms a(23) and beyond from Andrew Howroyd, Jan 30 2020

cp's OEIS Frontend

A060487 Triangle T(n,k) of k-block tricoverings of an n-set (n >= 3, k >= 4).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

A060483 Number of 5-block tricoverings of an n-set.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula

Extensions

A060485 Number of 7-block tricoverings of an n-set.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A060490 Number of 6-block ordered tricoverings of an unlabeled n-set.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

Extensions