The On-Line Encyclopedia of Integer Sequences (OEIS)

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A351994 revision #38

A351994

Number of spanning trees in a hexagon of size n in the triangular grid.

1, 320, 2300606464, 289899537900576358400, 614482906548854364363387716704247808, 21564742087547836976004856537464240189331001616154755072, 12433415382338420812828401445037903120443542018197863908895102595928462876835840

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,2

COMMENTS

The hexagon of size n in the triangular grid has A003215(n) vertices.

LINKS

Table of n, a(n) for n=0..6.

Peter Kagey, Image of one of the a(4) = 614482906548854364363387716704247808 spanning trees of size 4.

CROSSREFS

Cf. A007341 (square in square grid), A116469 (rectangle in square grid), A174579 (triangle in triangular grid), A351888 (triangle in hexagonal grid), A352022 (hexagon in hexagonal grid).

Sequence in context: A264063 A174778 A300849 * A261262 A308527 A268517

Adjacent sequences: A351991 A351992 A351993 * A351995 A351996 A351997

KEYWORD

nonn

AUTHOR

Peter Kagey, Feb 28 2022

STATUS

proposed