A381930 - cp's OEIS frontend

A381930 Irregular triangular array read by rows. T(n,k) is the number of length n words x on {0,1,2} such that I(x) + W_0(x)W_1(x) + W_0(x)W_2(x) + W_1(x)*W_2(x) = k where I(x) is the number of inversions in x and W_i(x) is the number of occurrences of the letter i in x for i={0,1,2}, n>=0, 0<=k<=floor(2n^2/3).

n	a(n)
0	1
1	3
2	3
3	3
4	3
5	3
6	0
7	6
8	7
9	8
10	2
11	1
12	3
13	0
14	0
15	6
16	9
17	12
18	18
19	12
20	12
21	6
22	3
23	3
24	0
25	0
26	0
27	6
28	6
29	12
30	15
31	27
32	27
33	36
34	33
35	33
36	21
37	15
38	6
39	3
40	3
41	0
42	0
43	0
44	0
45	6
46	6
47	6
48	12
49	18
50	27
51	33
52	52
53	62
54	77
55	82
56	86
57	75
58	68
59	48
60	35
61	19
62	11
63	2
64	1

[1, 3, 3, 3, 3, 3, 0, 6, 7, 8, 2, 1, 3, 0, 0, 6, 9, 12, 18, 12, 12, 6, 3, 3, 0, 0, 0, 6, 6, 12, 15, 27, 27, 36, 33, 33, 21, 15, 6, 3, 3, 0, 0, 0, 0, 6, 6, 6, 12, 18, 27, 33, 52, 62, 77, 82, 86, 75, 68, 48, 35, 19, 11, 2, 1]

cp's OEIS Frontend

Table of values

List of values

n	a(n)
0	1
1	3
2	3
3	3
4	3
5	3
6	0
7	6
8	7
9	8
10	2
11	1
12	3
13	0
14	0
15	6
16	9
17	12
18	18
19	12
20	12
21	6
22	3
23	3
24	0
25	0
26	0
27	6
28	6
29	12
30	15
31	27
32	27
33	36
34	33
35	33
36	21
37	15
38	6
39	3
40	3
41	0
42	0
43	0
44	0
45	6
46	6
47	6
48	12
49	18
50	27
51	33
52	52
53	62
54	77
55	82
56	86
57	75
58	68
59	48
60	35
61	19
62	11
63	2
64	1

n	a(n)
0	1
1	3
2	3
3	3
4	3
5	3
6	0
7	6
8	7
9	8
10	2
11	1
12	3
13	0
14	0
15	6
16	9
17	12
18	18
19	12
20	12
21	6
22	3
23	3
24	0
25	0
26	0
27	6
28	6
29	12
30	15
31	27
32	27
33	36
34	33
35	33
36	21
37	15
38	6
39	3
40	3
41	0
42	0
43	0
44	0
45	6
46	6
47	6
48	12
49	18
50	27
51	33
52	52
53	62
54	77
55	82
56	86
57	75
58	68
59	48
60	35
61	19
62	11
63	2
64	1

n	a(n)
0	1
1	3
2	3
3	3
4	3
5	3
6	0
7	6
8	7
9	8
10	2
11	1
12	3
13	0
14	0
15	6
16	9
17	12
18	18
19	12
20	12
21	6
22	3
23	3
24	0
25	0
26	0
27	6
28	6
29	12
30	15
31	27
32	27
33	36
34	33
35	33
36	21
37	15
38	6
39	3
40	3
41	0
42	0
43	0
44	0
45	6
46	6
47	6
48	12
49	18
50	27
51	33
52	52
53	62
54	77
55	82
56	86
57	75
58	68
59	48
60	35
61	19
62	11
63	2
64	1