A125209 - cp's OEIS frontend

A125209 Irregular triangle read by rows: T(n,k) (n>=1, 0<=k<=n(n-1)/2) is such that Sum_k T(n,k)p^(n(n-1)/2-k) gives the expectation of the number of connected components after deleting every edge of the complete graph on n labeled vertices with probability p.

n	a(n)
1	1
2	1
3	1
4	-1
5	3
6	0
7	1
8	2
9	-6
10	3
11	4
12	0
13	0
14	1
15	-6
16	20
17	-15
18	-10
19	10
20	0
21	5
22	0
23	0
24	0
25	1
26	24
27	-90
28	90
29	25
30	-60
31	0
32	-5
33	15
34	0
35	0
36	6
37	0
38	0
39	0
40	0
41	1
42	-120
43	504
44	-630
45	0
46	420
47	-105
48	0
49	-105
50	0
51	35
52	-21
53	21
54	0
55	0
56	0
57	7
58	0
59	0
60	0
61	0
62	0
63	1
64	720
65	-3360
66	5040
67	-1176
68	-3150
69	1680
70	140
71	560
72	-210
73	-280
74	112

[1, 1, 1, -1, 3, 0, 1, 2, -6, 3, 4, 0, 0, 1, -6, 20, -15, -10, 10, 0, 5, 0, 0, 0, 1, 24, -90, 90, 25, -60, 0, -5, 15, 0, 0, 6, 0, 0, 0, 0, 1, -120, 504, -630, 0, 420, -105, 0, -105, 0, 35, -21, 21, 0, 0, 0, 7, 0, 0, 0, 0, 0, 1, 720, -3360, 5040, -1176, -3150, 1680, 140, 560, -210, -280, 112]

cp's OEIS Frontend

A125209 Irregular triangle read by rows: T(n,k) (n>=1, 0<=k<=n(n-1)/2) is such that Sum_k T(n,k)p^(n(n-1)/2-k) gives the expectation of the number of connected components after deleting every edge of the complete graph on n labeled vertices with probability p.

Table of values

List of values

cp's OEIS Frontend

A125209 Irregular triangle read by rows: T(n,k) (n>=1, 0<=k<=n(n-1)/2) is such that Sum_k T(n,k)*p^(n*(n-1)/2-k) gives the expectation of the number of connected components after deleting every edge of the complete graph on n labeled vertices with probability p.

Table of values

List of values

A125209 Irregular triangle read by rows: T(n,k) (n>=1, 0<=k<=n(n-1)/2) is such that Sum_k T(n,k)p^(n(n-1)/2-k) gives the expectation of the number of connected components after deleting every edge of the complete graph on n labeled vertices with probability p.