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.

A066546 Number of spanning trees in the line graph of the box product of two (2 x n) grid graphs.

Original entry on oeis.org

4, 5976745079881894723584, 22561207271999971793667241231967232556265564782280146786713600000000, 7757960313423917565831233144393761302830112940189177166113578796780294097560917685262512568386612793431012933632000000000000000000000000
Offset: 1

Views

Author

Roberto E. Martinez II, Jan 07 2002

Keywords

Programs

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

Extensions

Edited by Dean Hickerson, Jan 14 2002
More terms from Sean A. Irvine, Jul 08 2025