A259094 - cp's OEIS frontend

A259094 From the Lecture Hall Theorem: array read by antidiagonals: T(n,k) = number of partitions of n into odd parts of size < 2k.

n	a(n)
1	1
2	1
3	1
4	1
5	1
6	1
7	1
8	1
9	1
10	1
11	1
12	1
13	1
14	2
15	1
16	1
17	1
18	1
19	2
20	2
21	1
22	1
23	1
24	1
25	2
26	2
27	2
28	1
29	1
30	1
31	1
32	2
33	2
34	3
35	3
36	1
37	1
38	1
39	1
40	2
41	2
42	3
43	4
44	3
45	1
46	1
47	1
48	1
49	2
50	2
51	3
52	4
53	4
54	3
55	1
56	1
57	1
58	1
59	2
60	2
61	3
62	4
63	5
64	5
65	4
66	1
67	1
68	1
69	1
70	2
71	2
72	3
73	4
74	5
75	6
76	6
77	4
78	1
79	1
80	1
81	1
82	2
83	2
84	3
85	4
86	5
87	6
88	7
89	7
90	4
91	1
92	1
93	1
94	1
95	2
96	2
97	3
98	4
99	5
100	6
101	8
102	9
103	8
104	5
105	1

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 2, 2, 3, 3, 1, 1, 1, 1, 2, 2, 3, 4, 3, 1, 1, 1, 1, 2, 2, 3, 4, 4, 3, 1, 1, 1, 1, 2, 2, 3, 4, 5, 5, 4, 1, 1, 1, 1, 2, 2, 3, 4, 5, 6, 6, 4, 1, 1, 1, 1, 2, 2, 3, 4, 5, 6, 7, 7, 4, 1, 1, 1, 1, 2, 2, 3, 4, 5, 6, 8, 9, 8, 5, 1]

cp's OEIS Frontend

A259094 From the Lecture Hall Theorem: array read by antidiagonals: T(n,k) = number of partitions of n into odd parts of size < 2k.

Table of values

List of values

n	a(n)
1	1
2	1
3	1
4	1
5	1
6	1
7	1
8	1
9	1
10	1
11	1
12	1
13	1
14	2
15	1
16	1
17	1
18	1
19	2
20	2
21	1
22	1
23	1
24	1
25	2
26	2
27	2
28	1
29	1
30	1
31	1
32	2
33	2
34	3
35	3
36	1
37	1
38	1
39	1
40	2
41	2
42	3
43	4
44	3
45	1
46	1
47	1
48	1
49	2
50	2
51	3
52	4
53	4
54	3
55	1
56	1
57	1
58	1
59	2
60	2
61	3
62	4
63	5
64	5
65	4
66	1
67	1
68	1
69	1
70	2
71	2
72	3
73	4
74	5
75	6
76	6
77	4
78	1
79	1
80	1
81	1
82	2
83	2
84	3
85	4
86	5
87	6
88	7
89	7
90	4
91	1
92	1
93	1
94	1
95	2
96	2
97	3
98	4
99	5
100	6
101	8
102	9
103	8
104	5
105	1

n	a(n)
1	1
2	1
3	1
4	1
5	1
6	1
7	1
8	1
9	1
10	1
11	1
12	1
13	1
14	2
15	1
16	1
17	1
18	1
19	2
20	2
21	1
22	1
23	1
24	1
25	2
26	2
27	2
28	1
29	1
30	1
31	1
32	2
33	2
34	3
35	3
36	1
37	1
38	1
39	1
40	2
41	2
42	3
43	4
44	3
45	1
46	1
47	1
48	1
49	2
50	2
51	3
52	4
53	4
54	3
55	1
56	1
57	1
58	1
59	2
60	2
61	3
62	4
63	5
64	5
65	4
66	1
67	1
68	1
69	1
70	2
71	2
72	3
73	4
74	5
75	6
76	6
77	4
78	1
79	1
80	1
81	1
82	2
83	2
84	3
85	4
86	5
87	6
88	7
89	7
90	4
91	1
92	1
93	1
94	1
95	2
96	2
97	3
98	4
99	5
100	6
101	8
102	9
103	8
104	5
105	1

n	a(n)
1	1
2	1
3	1
4	1
5	1
6	1
7	1
8	1
9	1
10	1
11	1
12	1
13	1
14	2
15	1
16	1
17	1
18	1
19	2
20	2
21	1
22	1
23	1
24	1
25	2
26	2
27	2
28	1
29	1
30	1
31	1
32	2
33	2
34	3
35	3
36	1
37	1
38	1
39	1
40	2
41	2
42	3
43	4
44	3
45	1
46	1
47	1
48	1
49	2
50	2
51	3
52	4
53	4
54	3
55	1
56	1
57	1
58	1
59	2
60	2
61	3
62	4
63	5
64	5
65	4
66	1
67	1
68	1
69	1
70	2
71	2
72	3
73	4
74	5
75	6
76	6
77	4
78	1
79	1
80	1
81	1
82	2
83	2
84	3
85	4
86	5
87	6
88	7
89	7
90	4
91	1
92	1
93	1
94	1
95	2
96	2
97	3
98	4
99	5
100	6
101	8
102	9
103	8
104	5
105	1