A378588 - cp's OEIS frontend

A378588 Triangle read by rows: T(n,k) is the number of maximal chains in the poset of all k-ary words of length <= n, ordered by B covers A iff A_i <= B_{i+k} for all i in A and some k >= 0.

n	a(n)
1	1
2	1
3	2
4	1
5	5
6	6
7	1
8	16
9	22
10	23
11	1
12	57
13	94
14	102
15	103
16	1
17	226
18	446
19	507
20	517
21	518
22	1
23	961
24	2308
25	2764
26	2855
27	2867
28	2868
29	1
30	4376
31	12900
32	16333
33	17121
34	17248
35	17262
36	17263
37	1
38	21041
39	77092
40	103666
41	110487
42	111739
43	111908
44	111924
45	111925
46	1
47	106534
48	489430
49	701819
50	761751
51	773888
52	775758
53	775975
54	775993
55	775994
56	1
57	563961
58	3282956
59	5038344
60	5578041
61	5696293
62	5716382
63	5719046
64	5719317
65	5719337
66	5719338

[1, 1, 2, 1, 5, 6, 1, 16, 22, 23, 1, 57, 94, 102, 103, 1, 226, 446, 507, 517, 518, 1, 961, 2308, 2764, 2855, 2867, 2868, 1, 4376, 12900, 16333, 17121, 17248, 17262, 17263, 1, 21041, 77092, 103666, 110487, 111739, 111908, 111924, 111925, 1, 106534, 489430, 701819, 761751, 773888, 775758, 775975, 775993, 775994, 1, 563961, 3282956, 5038344, 5578041, 5696293, 5716382, 5719046, 5719317, 5719337, 5719338]

cp's OEIS Frontend

A378588 Triangle read by rows: T(n,k) is the number of maximal chains in the poset of all k-ary words of length <= n, ordered by B covers A iff A_i <= B_{i+k} for all i in A and some k >= 0.

Table of values

List of values