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.

This page as a plain text file.
%I A066546 #11 Jul 08 2025 22:25:20
%S A066546 4,5976745079881894723584,
%T A066546 22561207271999971793667241231967232556265564782280146786713600000000,
%U A066546 7757960313423917565831233144393761302830112940189177166113578796780294097560917685262512568386612793431012933632000000000000000000000000
%N A066546 Number of spanning trees in the line graph of the box product of two (2 x n) grid graphs.
%H A066546 Sean A. Irvine, <a href="/A066546/b066546.txt">Table of n, a(n) for n = 1..6</a>
%t A066546 NumberOfSpanningTrees[LineGraph[GraphProduct[GridGraph[2, n], GridGraph[2, n]]]] (* First load package DiscreteMath`Combinatorica` *)
%K A066546 nonn
%O A066546 1,1
%A A066546 _Roberto E. Martinez II_, Jan 07 2002
%E A066546 Edited by _Dean Hickerson_, Jan 14 2002
%E A066546 More terms from _Sean A. Irvine_, Jul 08 2025