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).

Original entry on oeis.org

4, 69360, 25181448044544, 500282053019322336000000000, 1364205042837678184255639132540659302400000000, 1119704625219101611411719462621416231171361585800882437615771859939328
Offset: 2

Views

Author

Roberto E. Martinez II, Jan 07 2002

Keywords

Examples

			NumberOfSpanningTrees(L(S_3 x S_3)) = 69360
		

Programs

  • Mathematica
    NumberOfSpanningTrees[LineGraph[GraphProduct[Star[n], Star[n]]]] (* First load package DiscreteMath`Combinatorica` *)

Extensions

Edited by Dean Hickerson, Jan 14 2002