A332405 - cp's OEIS frontend

A332405 Triangle read by rows: T(n,k) is the number of simple graphs on n unlabeled nodes with upper irredundance number k.

n	a(n)
1	1
2	1
3	1
4	1
5	2
6	1
7	1
8	6
9	3
10	1
11	1
12	13
13	15
14	4
15	1
16	1
17	36
18	83
19	30
20	5
21	1
22	1
23	101
24	582
25	302
26	51
27	6
28	1
29	1
30	364
31	6025
32	5025
33	843
34	80
35	7
36	1
37	1
38	1511
39	99503
40	144371
41	27160
42	1996
43	117
44	8
45	1
46	1
47	7917
48	2706030
49	7441332
50	1733212
51	112291
52	4211
53	164
54	9
55	1

[1, 1, 1, 1, 2, 1, 1, 6, 3, 1, 1, 13, 15, 4, 1, 1, 36, 83, 30, 5, 1, 1, 101, 582, 302, 51, 6, 1, 1, 364, 6025, 5025, 843, 80, 7, 1, 1, 1511, 99503, 144371, 27160, 1996, 117, 8, 1, 1, 7917, 2706030, 7441332, 1733212, 112291, 4211, 164, 9, 1]

cp's OEIS Frontend

A332405 Triangle read by rows: T(n,k) is the number of simple graphs on n unlabeled nodes with upper irredundance number k.

Table of values

List of values