A125208 - cp's OEIS frontend

A125208 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^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	0
6	3
7	-1
8	1
9	0
10	0
11	4
12	3
13	-6
14	2
15	1
16	0
17	0
18	0
19	5
20	0
21	10
22	-10
23	-15
24	20
25	-6
26	1
27	0
28	0
29	0
30	0
31	6
32	0
33	0
34	15
35	-5
36	0
37	-60
38	25
39	90
40	-90
41	24
42	1
43	0
44	0
45	0
46	0
47	0
48	7
49	0
50	0
51	0
52	21
53	-21
54	35
55	0
56	-105
57	0
58	-105
59	420
60	0
61	-630
62	504
63	-120
64	1
65	0
66	0
67	0
68	0
69	0
70	0
71	8
72	0
73	0
74	0
75	0
76	28
77	-28
78	0
79	56
80	35
81	-168
82	112
83	-280

[1, 1, 1, 1, 0, 3, -1, 1, 0, 0, 4, 3, -6, 2, 1, 0, 0, 0, 5, 0, 10, -10, -15, 20, -6, 1, 0, 0, 0, 0, 6, 0, 0, 15, -5, 0, -60, 25, 90, -90, 24, 1, 0, 0, 0, 0, 0, 7, 0, 0, 0, 21, -21, 35, 0, -105, 0, -105, 420, 0, -630, 504, -120, 1, 0, 0, 0, 0, 0, 0, 8, 0, 0, 0, 0, 28, -28, 0, 56, 35, -168, 112, -280]

cp's OEIS Frontend

A125208 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^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