A213276 - cp's OEIS frontend

A213276 Number A(n,k) of n-length words w over a k-ary alphabet such that for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z; square array A(n,k), n>=0, k>=0, read by antidiagonals.

n	a(n)
0	1
1	1
2	0
3	1
4	1
5	0
6	1
7	2
8	1
9	0
10	1
11	3
12	4
13	1
14	0
15	1
16	4
17	9
18	5
19	1
20	0
21	1
22	5
23	16
24	18
25	9
26	1
27	0
28	1
29	6
30	25
31	46
32	36
33	14
34	1
35	0
36	1
37	7
38	36
39	95
40	118
41	74
42	27
43	1
44	0
45	1
46	8
47	49
48	171
49	315
50	276
51	165
52	46
53	1
54	0
55	1
56	9
57	64
58	280
59	711
60	895
61	712
62	367
63	91
64	1
65	0
66	1
67	10
68	81
69	428
70	1414
71	2506
72	2535
73	1805
74	869
75	162
76	1
77	0

[1, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 3, 4, 1, 0, 1, 4, 9, 5, 1, 0, 1, 5, 16, 18, 9, 1, 0, 1, 6, 25, 46, 36, 14, 1, 0, 1, 7, 36, 95, 118, 74, 27, 1, 0, 1, 8, 49, 171, 315, 276, 165, 46, 1, 0, 1, 9, 64, 280, 711, 895, 712, 367, 91, 1, 0, 1, 10, 81, 428, 1414, 2506, 2535, 1805, 869, 162, 1, 0]

cp's OEIS Frontend

A213276 Number A(n,k) of n-length words w over a k-ary alphabet such that for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

List of values