A292795 - cp's OEIS frontend

A292795 Number A(n,k) of sets of nonempty words with a total of n letters over k-ary alphabet such that within each word every letter of the alphabet is at least as frequent as the subsequent alphabet letter; 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	1
8	1
9	0
10	1
11	1
12	3
13	2
14	0
15	1
16	1
17	3
18	7
19	2
20	0
21	1
22	1
23	3
24	13
25	18
26	3
27	0
28	1
29	1
30	3
31	13
32	36
33	42
34	4
35	0
36	1
37	1
38	3
39	13
40	60
41	122
42	110
43	5
44	0
45	1
46	1
47	3
48	13
49	60
50	206
51	433
52	250
53	6
54	0
55	1
56	1
57	3
58	13
59	60
60	326
61	865
62	1356
63	627
64	8
65	0
66	1
67	1
68	3
69	13
70	60
71	326
72	1345
73	3408
74	4449
75	1439
76	10
77	0

[1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 3, 2, 0, 1, 1, 3, 7, 2, 0, 1, 1, 3, 13, 18, 3, 0, 1, 1, 3, 13, 36, 42, 4, 0, 1, 1, 3, 13, 60, 122, 110, 5, 0, 1, 1, 3, 13, 60, 206, 433, 250, 6, 0, 1, 1, 3, 13, 60, 326, 865, 1356, 627, 8, 0, 1, 1, 3, 13, 60, 326, 1345, 3408, 4449, 1439, 10, 0]

cp's OEIS Frontend

A292795 Number A(n,k) of sets of nonempty words with a total of n letters over k-ary alphabet such that within each word every letter of the alphabet is at least as frequent as the subsequent alphabet letter; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

List of values