%I A066545
%S A066545 4,782757789696,391497025772177207236260602767731880976449536,
%T A066545 7957171782556586274486115970349133441607298412757563479047423630290551952200534008528896000000000000000000000\
               0
%N A066545 Number of spanning trees in the line graph of the product of two complete 
               graph, each of order n, L(K_n x K_n).
%C A066545 a(2) = 2^2, a(3) = 2^30 * 3^6, a(4) = 2^99 * 3^31, a(5) = 2^314 * 5^22 
               - Gerald McGarvey (gerald.mcgarvey(AT)comcast.net), Oct 20 2007
%e A066545 NumberOfSpanningTrees(L(K_2 x K_2)) = 4
%t A066545 NumberOfSpanningTrees[LineGraph[GraphProduct[CompleteGraph[n], CompleteGraph[n]]]] 
               (* First load package DiscreteMath`Combinatorica` *)
%Y A066545 Sequence in context: A034250 A058436 A067501 this_sequence A161405 A147876 
               A164796
%Y A066545 Adjacent sequences: A066542 A066543 A066544 this_sequence A066546 A066547 
               A066548
%K A066545 hard,nonn
%O A066545 2,1
%A A066545 Roberto E. Martinez II (remartin(AT)fas.harvard.edu), Jan 07 2002
%E A066545 Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com), Jan 14, 2002