[go: up one dir, main page]

login
Revision History for A135021 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Triangle read by rows: T(n,r) = number of maximum r-uniform acyclic hypergraphs of order n and size n-r+1, 1 <= r <= n+1.
(history; published version)
#28 by OEIS Server at Sat Mar 02 12:00:54 EST 2024
LINKS

G. C. Greubel, <a href="/A135021/b135021_1.txt">Table of n, a(n) for n = 0..1325</a> (rows 0..50)

#27 by Michel Marcus at Sat Mar 02 12:00:54 EST 2024
STATUS

reviewed

approved

Discussion
Sat Mar 02
12:00
OEIS Server: Installed new b-file as b135021.txt.  Old b-file is now b135021_1.txt.
#26 by Joerg Arndt at Sat Mar 02 11:51:10 EST 2024
STATUS

proposed

reviewed

#25 by Jon E. Schoenfield at Sat Mar 02 11:21:16 EST 2024
STATUS

editing

proposed

#24 by Jon E. Schoenfield at Sat Mar 02 11:20:38 EST 2024
EXAMPLE

From Bruno Berselli, Dec 08 2012: (Start)

1 , 1;

[Bruno Berselli, Dec 08 2012]

(End)

STATUS

proposed

editing

#23 by Andrew Howroyd at Sat Mar 02 11:12:21 EST 2024
STATUS

editing

proposed

#22 by Andrew Howroyd at Sat Mar 02 11:07:59 EST 2024
DATA

1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 16, 6, 1, 1, 1, 125, 70, 10, 1, 1, 1, 1296, 1215, 200, 15, 1, 1, 1, 16807, 27951, 5915, 455, 21, 1, 1, 1, 262144, 799708, 229376, 20230, 896, 28, 1, 1, 1, 4782969, 27337500, 10946964, 1166886, 55566, 1596, 36, 1, 1, 1, 100000000, 1086190605, 618435840, 82031250, 4429152, 131250, 2640, 45, 1, 1, 1, 2357947691, 49162945645, 40283203125, 6768679170, 426666702, 13763442, 277530, 4125, 55, 1, 1

Discussion
Sat Mar 02
11:12
Andrew Howroyd: I've inserted an extra diagonal of  1's. All the column sequences A036361, A036362, A036506 start with 2 1's, so it makes sense for this triangle to be consistent. The formula also gives this.
#21 by Andrew Howroyd at Sat Mar 02 11:04:59 EST 2024
NAME

Triangle read by rows: T(n,r) = number of maximum r-uniform acyclic hypergraphs of order n and size n-r+1, 1 <= r <= n+1.

LINKS

G. C. Greubel, <a href="/A135021/b135021_1.txt">Table of n, a(n) for the first 50 n = 0..1325</a> (rows</a> 0..50)

EXAMPLE

1,;

1, 1;

1, 3, 1, 1;

1, 16, 6, 3, 1, 1;

1, 125, 70, 10, 16, 6, 1, 1;

1, 1296, 1215, 200, 15, 125, 70, 10, 1, 1;

1, 16807, 27951, 5915, 455, 21, 1296, 1215, 200, 15, 1, 1;

1, 262144, 799708, 229376, 20230, 896, 28, 16807, 27951, 5915, 455, 21, 1, 1;

1, 262144, 799708, 229376, 20230, 896, 28, 1, 1;

1, 4782969, 27337500, 10946964, 1166886, 55566, 1596, 36, 1, etc.1;

CROSSREFS

Cf. A370770 (unlabeled version).

#20 by Andrew Howroyd at Sat Mar 02 10:59:10 EST 2024
DATA

1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 16, 6, 1, 1, 1, 125, 70, 10, 1, 1, 1, 1296, 1215, 200, 15, 1, 1, 1, 16807, 27951, 5915, 455, 21, 1, 1, 1, 262144, 799708, 229376, 20230, 896, 28, 1, 1, 1, 4782969, 27337500, 10946964, 1166886, 55566, 1596, 36, 1, 1, 1, 100000000, 1086190605, 618435840, 82031250, 4429152, 131250, 2640, 45, 1, 1, 1, 2357947691, 49162945645, 40283203125, 6768679170, 426666702, 13763442, 277530, 4125, 55, 1, 1

OFFSET

1,5

0,8

COMMENTS

T(n,r) is the number of (r-1)-trees on n nodes. - Andrew Howroyd, Mar 02 2024

FORMULA

T(n,r) = Cbinomial(n,r-1)*(n*(r-1)-r^2+2r2*r)^(n-r-1).

PROG

(PARI) T(n, r) = binomial(n, r-1)*(n*(r-1)-r^2+2*r)^(n-r-1) \\ Andrew Howroyd, Mar 02 2024

CROSSREFS

Columns 1..5 are A000012, A000272, A036361, A036362, A036506.

EXTENSIONS

Diagonal r=n+1 inserted by Andrew Howroyd, Mar 02 2024

#19 by Andrew Howroyd at Fri Mar 01 17:15:47 EST 2024
EXAMPLE

1,

1, 1;

1, 3, 1;

1, 16, 6, 1;

1, 125, 70, 10, 1;

1, 1296, 1215, 200, 15, 1;

1, 16807, 27951, 5915, 455, 21, 1;

1, 262144, 799708, 229376, 20230, 896, 28, 1;

1, 4782969, 27337500, 10946964, 1166886, 55566, 1596, 36, 1, etc.

CROSSREFS
STATUS

approved

editing