A347630 - cp's OEIS frontend

A347630 Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) is the number of partitions of n^k into distinct odd parts.

n	a(n)
0	1
1	1
2	1
3	1
4	1
5	1
6	1
7	1
8	0
9	1
10	1
11	1
12	1
13	1
14	1
15	1
16	1
17	2
18	2
19	1
20	1
21	1
22	1
23	5
24	14
25	5
26	1
27	1
28	1
29	1
30	23
31	833
32	276
33	12
34	1
35	1
36	1
37	1
38	276
39	1731778
40	2824974
41	9912
42	33
43	1
44	1
45	1
46	1
47	11564
48	1741020966255
49	824068326214949
50	150145281903
51	602245
52	93
53	2
54	1
55	1
56	1
57	2824974
58	78444810948209793568790
59	195321031346209256918890884699755
60	7375247711025022789604527681
61	116880108216597935
62	57638873
63	276
64	2
65	1

[1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 5, 14, 5, 1, 1, 1, 1, 23, 833, 276, 12, 1, 1, 1, 1, 276, 1731778, 2824974, 9912, 33, 1, 1, 1, 1, 11564, 1741020966255, 824068326214949, 150145281903, 602245, 93, 2, 1, 1, 1, 2824974, 78444810948209793568790, 195321031346209256918890884699755, 7375247711025022789604527681, 116880108216597935, 57638873, 276, 2, 1]

cp's OEIS Frontend

A347630 Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) is the number of partitions of n^k into distinct odd parts.

Table of values

List of values