A294490 - cp's OEIS frontend

A294490 Triangle read by rows: T(n,k) is the number of simple connected graphs on n vertices having independence number k.

n	a(n)
1	1
2	1
3	0
4	1
5	1
6	0
7	1
8	4
9	1
10	0
11	1
12	11
13	8
14	1
15	0
16	1
17	34
18	63
19	13
20	1
21	0
22	1
23	103
24	524
25	205
26	19
27	1
28	0
29	1
30	405
31	5863
32	4308
33	513
34	26
35	1
36	0
37	1
38	1892
39	100702
40	135563
41	21782
42	1105
43	34
44	1
45	0
46	1
47	12166
48	2880002
49	7161399
50	1576634
51	84185
52	2140
53	43
54	1
55	0
56	1
57	105065
58	138772607
59	652024627
60	203380116
61	12140094
62	274156
63	3845
64	53
65	1
66	0

[1, 1, 0, 1, 1, 0, 1, 4, 1, 0, 1, 11, 8, 1, 0, 1, 34, 63, 13, 1, 0, 1, 103, 524, 205, 19, 1, 0, 1, 405, 5863, 4308, 513, 26, 1, 0, 1, 1892, 100702, 135563, 21782, 1105, 34, 1, 0, 1, 12166, 2880002, 7161399, 1576634, 84185, 2140, 43, 1, 0, 1, 105065, 138772607, 652024627, 203380116, 12140094, 274156, 3845, 53, 1, 0]

cp's OEIS Frontend

A294490 Triangle read by rows: T(n,k) is the number of simple connected graphs on n vertices having independence number k.

Table of values

List of values