%I A053528
%S A053528 0,0,0,0,0,60,1701,14952,81228,331884,1116675,3256407,8500734,20306286,
%T A053528 45093048,94189095,186736368,353904096,644842674,1134910242,1936817820,
%U A053528 3215467584,5207403663,8245956642,12793342716,19481177100,29161079805
%N A053528 Number of bipartite graphs with 5 edges on nodes {1..n}.
%D A053528 R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see 
               Problem 5.5.
%F A053528 (n-4)(n-3)(n-2)(n-1)n(n^5+5n^4+5n^3-85n^2-374n-960)/3840.
%Y A053528 Cf. A000217 (1 edge), A050534 (2 edges), A053526 (3 edges), A053527 (4 
               edges).
%Y A053528 Sequence in context: A146347 A054331 A160349 this_sequence A017776 A035725 
               A035800
%Y A053528 Adjacent sequences: A053525 A053526 A053527 this_sequence A053529 A053530 
               A053531
%K A053528 nonn
%O A053528 0,6
%A A053528 N. J. A. Sloane (njas(AT)research.att.com), Jan 16 2000