The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A338832 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A338832

Number of spanning trees in the k_1 X ... X k_j grid graph, where (k_1 - 1, ..., k_j - 1) is the partition with Heinz number n.
(history; published version)

#16 by Wesley Ivan Hurt at Sun Jan 03 00:26:08 EST 2021

STATUS

reviewed

approved

#15 by Michel Marcus at Sun Jan 03 00:24:57 EST 2021

STATUS

proposed

reviewed

#14 by Jon E. Schoenfield at Sun Jan 03 00:22:45 EST 2021

STATUS

editing

proposed

#13 by Jon E. Schoenfield at Sun Jan 03 00:22:41 EST 2021

FORMULA

a(n) = Product_{n_1=0..k_1-1, ..., n_j=0..k_j-1; not all n_i=0} Sum_{i=1..j} (2*(1 - cos(n_i*Pi/k_i))) / Prod_Product_{i=1..j} k_i, where (k_1 - 1, ..., k_j - 1) is the partition with Heinz number n.

STATUS

approved

editing

#12 by Peter Luschny at Fri Nov 27 10:48:39 EST 2020

STATUS

reviewed

approved

#11 by Joerg Arndt at Fri Nov 27 10:43:46 EST 2020

STATUS

proposed

reviewed

#10 by Michel Marcus at Fri Nov 27 10:15:13 EST 2020

STATUS

editing

proposed

#9 by Michel Marcus at Fri Nov 27 10:15:09 EST 2020

FORMULA

a(n) = Prod_Product_{n_1=0..k_1-1, ..., n_j=0..k_j-1; not all n_i=0} Sum_{i=1..j} (2*(1 - cos(n_i*Pi/k_i))) / Prod_{i=1..j} k_i, where (k_1 - 1, ..., k_j - 1) is the partition with Heinz number n.

STATUS

proposed

editing

#8 by Pontus von Brömssen at Fri Nov 27 08:13:14 EST 2020

STATUS

editing

proposed

#7 by Pontus von Brömssen at Fri Nov 27 08:12:55 EST 2020

LINKS

Pontus von Brömssen, <a href="/A338832/b338832.txt">Table of n, a(n) for n = 1..1151</a>

STATUS

approved

editing