%I A053527
%S A053527 0,0,0,0,3,140,1125,5355,19075,56133,143955,332475,706860,1404975,
%T A053527 2640638,4733820,8149050,13543390,21825450,34227018,52388985,78463350,
%U A053527 115233195,166252625,236008773,330108075,455489125,620664525,835994250
%N A053527 Number of bipartite graphs with 4 edges on nodes {1..n}.
%D A053527 R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see 
               Problem 5.5.
%F A053527 (n-3)(n-2)(n-1)n(n+2)(n^3-5n-36)/384.
%Y A053527 Cf. A000217 (1 edge), A050534 (2 edges), A053526 (3 edges).
%Y A053527 Sequence in context: A139956 A016067 A070322 this_sequence A152504 A035331 
               A050819
%Y A053527 Adjacent sequences: A053524 A053525 A053526 this_sequence A053528 A053529 
               A053530
%K A053527 nonn
%O A053527 0,5
%A A053527 N. J. A. Sloane (njas(AT)research.att.com), Jan 16 2000