login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060094 Number of 6-block ordered bicoverings of an unlabeled n-set. 3
0, 0, 0, 0, 90, 1716, 11350, 49860, 173745, 519345, 1389078, 3411060, 7821950, 16949910, 35013240, 69404416, 132703770, 245767890, 442372300, 776064960, 1330117230, 2231754820, 3672227850, 5934754020, 9432962515, 14763202395 (list; graph; refs; listen; history; internal format)
OFFSET

0,5

LINKS

Harry J. Smith, Table of n, a(n) for n=0,...,1000

FORMULA

a(n) = binomial(n + 14, n) - 6*binomial(n + 9, 9) - 15*binomial(n + 6, 6) + 30*binomial(n + 5, 5) + 60*binomial(n + 3, 3) - 50*binomial(n + 2, 2) - 180*binomial(n + 1, 1) + 240*binomial(n, 0) - 80*binomial(n - 1, - 1); G.f.: - y^4*(366*y - 16950*y^8 + 36420*y^7 - 54120*y^6 + 56290*y^5 - 40335*y^4 + 18840*y^3 - 4940*y^2 - 960*y^10 + 80*y^11 + 5220*y^9 + 90)/( - 1 + y)^15; E.g.f. for k-block ordered bicoverings of an unlabeled n-set is exp( - x - x^2/2*y/(1 - y))*Sum_{k = 0..inf} 1/(1 - y)^binomial(k, 2)*x^k/k!.

PROG

(PARI) { for (n=0, 1000, a=binomial(n + 14, n) - 6*binomial(n + 9, 9) - 15*binomial(n + 6, 6) + 30*binomial(n + 5, 5) + 60*binomial(n + 3, 3) - 50*binomial(n + 2, 2) - 180*binomial(n + 1, 1) + 240*binomial(n, 0) - 80*binomial(n - 1, - 1); if (n==0, a=0); write("b060094.txt", n, " ", a); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 01 2009]

CROSSREFS

Cf. A060090-A060093, A060095, A060069, A060070, A060051-A060053, A002718, A059443, A003462, A059945-A059951.

Sequence in context: A166817 A166799 A001561 * A201062 A065951 A008393

Adjacent sequences:  A060091 A060092 A060093 * A060095 A060096 A060097

KEYWORD

nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 26 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 11:46 EST 2012. Contains 206011 sequences.