A292746 - cp's OEIS frontend

A292746 Triangle read by rows: T(n,k) (n>=0, 0<=k<=n) = number of partitions of n with exactly k kinds of 1's which are introduced in ascending order.

n	a(n)
0	1
1	0
2	1
3	1
4	1
5	1
6	1
7	2
8	3
9	1
10	2
11	3
12	8
13	6
14	1
15	2
16	5
17	19
18	26
19	10
20	1
21	4
22	7
23	43
24	97
25	66
26	15
27	1
28	4
29	11
30	93
31	334
32	361
33	141
34	21
35	1
36	7
37	15
38	197
39	1095
40	1778
41	1066
42	267
43	28
44	1
45	8
46	22
47	409
48	3482
49	8207
50	7108
51	2668
52	463
53	36
54	1
55	12
56	30
57	840
58	10855
59	36310
60	43747
61	23116
62	5909
63	751
64	45
65	1

[1, 0, 1, 1, 1, 1, 1, 2, 3, 1, 2, 3, 8, 6, 1, 2, 5, 19, 26, 10, 1, 4, 7, 43, 97, 66, 15, 1, 4, 11, 93, 334, 361, 141, 21, 1, 7, 15, 197, 1095, 1778, 1066, 267, 28, 1, 8, 22, 409, 3482, 8207, 7108, 2668, 463, 36, 1, 12, 30, 840, 10855, 36310, 43747, 23116, 5909, 751, 45, 1]

cp's OEIS Frontend

A292746 Triangle read by rows: T(n,k) (n>=0, 0<=k<=n) = number of partitions of n with exactly k kinds of 1's which are introduced in ascending order.

Table of values

List of values