A386632 - cp's OEIS frontend

A386632 Numbers k such that there is a disjoint inseparable way to choose a strict integer partition of each exponent in the prime factorization of k.

n	a(n)
1	8
2	16
3	27
4	32
5	64
6	81
7	125
8	128
9	243
10	256
11	343
12	512
13	625
14	729
15	1024
16	1331
17	1536
18	2048
19	2187
20	2197
21	2304
22	2401
23	2560
24	3072
25	3125
26	3456
27	3584
28	4096
29	4608
30	4913
31	5120
32	5184
33	5632
34	6144
35	6400
36	6561
37	6656
38	6859
39	6912
40	7168
41	8192
42	8704
43	9216
44	9728
45	10240
46	11264

[8, 16, 27, 32, 64, 81, 125, 128, 243, 256, 343, 512, 625, 729, 1024, 1331, 1536, 2048, 2187, 2197, 2304, 2401, 2560, 3072, 3125, 3456, 3584, 4096, 4608, 4913, 5120, 5184, 5632, 6144, 6400, 6561, 6656, 6859, 6912, 7168, 8192, 8704, 9216, 9728, 10240, 11264]

cp's OEIS Frontend

A386632 Numbers k such that there is a disjoint inseparable way to choose a strict integer partition of each exponent in the prime factorization of k.

Table of values

List of values