login

Revision History for A260383

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Triangle read by rows: number of spanning trees obtained for an almost-complete bipartite graph by removing k disjoint edges from the complete bipartite graph K n,n with k<=n.
(history; published version)
#16 by Charles R Greathouse IV at Thu Sep 08 08:46:13 EDT 2022
PROG

(MAGMAMagma) /* As triangle */ [[((n-2)*n+k)*(n-2)^(k-1)*n^(2*n-k-3): k in [1..n]]: n in [1.. 15]]; // Vincenzo Librandi, Jul 24 2015

Discussion
Thu Sep 08
08:46
OEIS Server: https://oeis.org/edit/global/2944
#15 by Michel Marcus at Wed Apr 27 10:37:47 EDT 2016
STATUS

reviewed

approved

#14 by Alonso del Arte at Wed Apr 27 10:19:59 EDT 2016
STATUS

proposed

reviewed

Discussion
Wed Apr 27
10:37
Michel Marcus: Sure
#13 by Andrew Howroyd at Wed Apr 27 10:13:13 EDT 2016
STATUS

editing

proposed

Discussion
Wed Apr 27
10:19
Alonso del Arte: Thank you very much for catching that.
#12 by Andrew Howroyd at Wed Apr 27 10:13:05 EDT 2016
CROSSREFS

nonn,tabl

KEYWORD

nonn,tabl

STATUS

approved

editing

#11 by N. J. A. Sloane at Tue Jul 28 12:51:15 EDT 2015
STATUS

proposed

approved

#10 by Michel Marcus at Mon Jul 27 12:11:42 EDT 2015
STATUS

editing

proposed

#9 by Michel Marcus at Mon Jul 27 12:11:31 EDT 2015
NAME

Tiangle Triangle read by rows: number of spanning trees obtained for an almost-complete bipartite graph by removing k disjoint edges from the complete bipartite graph K n,n with k<=n.

STATUS

proposed

editing

Discussion
Mon Jul 27
12:11
Michel Marcus: tss, tss ..
#8 by Vincenzo Librandi at Fri Jul 24 03:51:21 EDT 2015
STATUS

editing

proposed

#7 by Vincenzo Librandi at Fri Jul 24 03:50:48 EDT 2015
DATA

0, 1, 0, 36, 15, 6, 2304, 1280, 704, 384, 250000, 159375, 101250, 64125, 40500, 41990400, 29113344, 20155392, 13934592, 9621504, 6635520, 10169108964, 7465417295, 5476560950, 4014772125, 2941225000, 2153396875, 1575656250, 3367254360064, 2576980377600

MATHEMATICA

Join[{0, 1, 0}, t[n_, k_]:=((n - 2) n + k) (n - 2)^(k - 1) n^(2 n - k - 3); Table[t[n, k], {n, 3, 10}, {k, n}]//Flatten] (* Vincenzo Librandi, Jul 24 2015 *)

PROG

(MAGMA) /* As triangle */ [[((n-2)*n+k)*(n-2)^(k-1)*n^(2*n-k-3): k in [1..n]]: n in [1.. 15]]; // Vincenzo Librandi, Jul 24 2015

STATUS

proposed

editing