Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080691
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080691 Number of spanning forests of n X n grid graphs. +0
1
1, 15, 3102, 8790016, 341008617408, 181075508242067552, 1315927389374152034113856, 130877523274817580209987036404864, 178135975585132088643635627145305047963624 (list; graph; listen)
OFFSET

1,2

REFERENCES

N. Calkin, C. Merino, S. Noble and M. Noy Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice, The Electronic Journal of Combinatorics, Volume 10(1), 2003

LINKS

Peter Tittmann, More Result.

CROSSREFS

Adjacent sequences: A080688 A080689 A080690 this_sequence A080692 A080693 A080694

Sequence in context: A126681 A126678 A108281 this_sequence A013720 A139297 A070907

KEYWORD

hard,nonn

AUTHOR

Andre Poenitz [Po"nitz], Peter Tittmann (poenitz(AT)htwm.de), Mar 03 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 15 09:18 EDT 2008. Contains 145015 sequences.


AT&T Labs Research