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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A334002 Number of spanning trees in the graph P_7 x P_n. 3
 1, 2911, 4768673, 7022359583, 10021992194369, 14143261515284447, 19872369301840986112, 27873182693625548898079, 39067130344394503972142977, 54740416599810921320592441119, 76692291658239649098972455530913, 107441842254735898225957962027174559, 150517199699838971875005120330439121217 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Seiichi Manyama, Table of n, a(n) for n = 1..200 Vaclav Kotesovec, Generating function MATHEMATICA a[n_] := Resultant[ChebyshevU[n - 1, x/2], ChebyshevU[6, (4 - x)/2], x]; Array[a, 13] (* Amiram Eldar, May 04 2021 *) PROG (Python) # Using graphillion from graphillion import GraphSet import graphillion.tutorial as tl def A116469(n, k): if n == 1 or k == 1: return 1 universe = tl.grid(n - 1, k - 1) GraphSet.set_universe(universe) spanning_trees = GraphSet.trees(is_spanning=True) return spanning_trees.len() def A334002(n): return A116469(n, 7) print([A334002(n) for n in range(1, 15)]) CROSSREFS Row m=7 of A116469. Sequence in context: A054829 A289228 A250953 * A344474 A203376 A183360 Adjacent sequences: A333999 A334000 A334001 * A334003 A334004 A334005 KEYWORD nonn AUTHOR Seiichi Manyama, Apr 12 2020 STATUS approved

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

Last modified September 10 09:32 EDT 2024. Contains 375786 sequences. (Running on oeis4.)