A335442 - cp's OEIS frontend

A335442 List enumerated in lexicographic order of (n, s, k), where for each n >= 1, for each s a subset of 1..n with n-1 elements, and for each k in 0..n-1, we give the value of (Sum_{t subset of s, Card(t)=k} Product_{x in t} x).

n	a(n)
1	1
2	1
3	1
4	1
5	2
6	1
7	3
8	2
9	1
10	4
11	3
12	1
13	5
14	6
15	1
16	6
17	11
18	6
19	1
20	7
21	14
22	8
23	1
24	8
25	19
26	12
27	1
28	9
29	26
30	24
31	1
32	10
33	35
34	50
35	24
36	1
37	11
38	41
39	61
40	30
41	1
42	12
43	49
44	78
45	40
46	1
47	13
48	59
49	107
50	60
51	1
52	14
53	71
54	154
55	120
56	1
57	15
58	85
59	225
60	274
61	120
62	1
63	16
64	95
65	260
66	324
67	144
68	1
69	17
70	107
71	307
72	396
73	180
74	1
75	18
76	121
77	372
78	508
79	240
80	1
81	19
82	137
83	461
84	702
85	360
86	1
87	20
88	155
89	580
90	1044
91	720

[1, 1, 1, 1, 2, 1, 3, 2, 1, 4, 3, 1, 5, 6, 1, 6, 11, 6, 1, 7, 14, 8, 1, 8, 19, 12, 1, 9, 26, 24, 1, 10, 35, 50, 24, 1, 11, 41, 61, 30, 1, 12, 49, 78, 40, 1, 13, 59, 107, 60, 1, 14, 71, 154, 120, 1, 15, 85, 225, 274, 120, 1, 16, 95, 260, 324, 144, 1, 17, 107, 307, 396, 180, 1, 18, 121, 372, 508, 240, 1, 19, 137, 461, 702, 360, 1, 20, 155, 580, 1044, 720]

cp's OEIS Frontend

A335442 List enumerated in lexicographic order of (n, s, k), where for each n >= 1, for each s a subset of 1..n with n-1 elements, and for each k in 0..n-1, we give the value of (Sum_{t subset of s, Card(t)=k} Product_{x in t} x).

Table of values

List of values