A261719 - cp's OEIS frontend

A261719 Number T(n,k) of partitions of n where each part i is marked with a word of length i over a k-ary alphabet whose letters appear in alphabetical order and all k letters occur at least once in the partition; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

n	a(n)
0	1
1	0
2	1
3	0
4	2
5	3
6	0
7	3
8	12
9	10
10	0
11	5
12	40
13	81
14	47
15	0
16	7
17	104
18	396
19	544
20	246
21	0
22	11
23	279
24	1751
25	4232
26	4350
27	1602
28	0
29	15
30	654
31	6528
32	25100
33	44475
34	36744
35	11481
36	0
37	22
38	1577
39	23892
40	136516
41	369675
42	512787
43	352793
44	95503
45	0
46	30
47	3560
48	80979
49	666800
50	2603670
51	5413842
52	6170486
53	3641992
54	871030

[1, 0, 1, 0, 2, 3, 0, 3, 12, 10, 0, 5, 40, 81, 47, 0, 7, 104, 396, 544, 246, 0, 11, 279, 1751, 4232, 4350, 1602, 0, 15, 654, 6528, 25100, 44475, 36744, 11481, 0, 22, 1577, 23892, 136516, 369675, 512787, 352793, 95503, 0, 30, 3560, 80979, 666800, 2603670, 5413842, 6170486, 3641992, 871030]

cp's OEIS Frontend

A261719 Number T(n,k) of partitions of n where each part i is marked with a word of length i over a k-ary alphabet whose letters appear in alphabetical order and all k letters occur at least once in the partition; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

List of values