login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080691 Number of spanning forests of the n X n grid graph. 0

%I

%S 1,15,3102,8790016,341008617408,181075508242067552,

%T 1315927389374152034113856,130877523274817580209987036404864,

%U 178135975585132088643635627145305047963624

%N Number of spanning forests of the n X n grid graph.

%H N. Calkin, C. Merino, S. Noble and M. Noy, <a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v10i1r4">Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice</a>, The Electronic Journal of Combinatorics, Volume 10(1), 2003, #R4.

%H A. P&ouml;nitz, <a href="http://www.qucosa.de/fileadmin/data/qucosa/documents/2080/MathematikPXnitzAndrX756952.pdf">&Uuml;ber eine Methode zur Konstruktion...</a> PhD Thesis (2004) C.3.

%H Peter Tittmann, <a href="https://web.archive.org/web/20070715034048/http://www.htwm.de/~peter/research/enumeration.html">More Results</a> [Gives a(1)-a(14)]

%K nonn

%O 1,2

%A Andre Poenitz [Po"nitz], _Peter Tittmann_, Mar 03 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 18 03:25 EDT 2021. Contains 348065 sequences. (Running on oeis4.)