A181695 - cp's OEIS frontend

A181695 Triangle read by rows: T(n,m) = number of solutions x_1 + x_2 + ... + x_k <= n, where 1 <= x_i <= m, and any k >= 1.

n	a(n)
1	1
2	2
3	3
4	3
5	6
6	7
7	4
8	11
9	14
10	15
11	5
12	19
13	27
14	30
15	31
16	6
17	32
18	51
19	59
20	62
21	63
22	7
23	53
24	95
25	115
26	123
27	126
28	127
29	8
30	87
31	176
32	223
33	243
34	251
35	254
36	255
37	9
38	142
39	325
40	431
41	479
42	499
43	507
44	510
45	511
46	10
47	231
48	599
49	832
50	943
51	991
52	1011
53	1019
54	1022
55	1023
56	11
57	375
58	1103
59	1605

[1, 2, 3, 3, 6, 7, 4, 11, 14, 15, 5, 19, 27, 30, 31, 6, 32, 51, 59, 62, 63, 7, 53, 95, 115, 123, 126, 127, 8, 87, 176, 223, 243, 251, 254, 255, 9, 142, 325, 431, 479, 499, 507, 510, 511, 10, 231, 599, 832, 943, 991, 1011, 1019, 1022, 1023, 11, 375, 1103, 1605]

cp's OEIS Frontend

A181695 Triangle read by rows: T(n,m) = number of solutions x_1 + x_2 + ... + x_k <= n, where 1 <= x_i <= m, and any k >= 1.

Table of values

List of values