cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A066544 Number of spanning trees in the line graph of the product of two star graphs, each of order n, L(S_n x S_n).

This page as a plain text file.
%I A066544 #6 Jul 02 2025 19:36:49
%S A066544 4,69360,25181448044544,500282053019322336000000000,
%T A066544 1364205042837678184255639132540659302400000000,
%U A066544 1119704625219101611411719462621416231171361585800882437615771859939328
%N A066544 Number of spanning trees in the line graph of the product of two star graphs, each of order n, L(S_n x S_n).
%e A066544 NumberOfSpanningTrees(L(S_3 x S_3)) = 69360
%t A066544 NumberOfSpanningTrees[LineGraph[GraphProduct[Star[n], Star[n]]]] (* First load package DiscreteMath`Combinatorica` *)
%K A066544 nonn
%O A066544 2,1
%A A066544 _Roberto E. Martinez II_, Jan 07 2002
%E A066544 Edited by _Dean Hickerson_, Jan 14 2002

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

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