A367913 - cp's OEIS frontend

A367913 Least number k such that there are exactly n ways to choose a multiset consisting of a binary index of each binary index of k.

n	a(n)
1	1
2	4
3	64
4	20
5	68
6	320
7	52
8	84
9	16448
10	324
11	832
12	116
13	1104
14	308
15	816
16	340
17	836
18	848
19	1108
20	1136
21	1360
22	3152
23	16708
24	372
25	5188
26	5216
27	852
28	880
29	2884
30	1364
31	13376
32	1392
33	3184
34	3424
35	17220
36	5204
37	5220
38	2868
39	5728
40	884
41	19536
42	66896
43	2900
44	1396
45	21572
46	3188
47	3412

[1, 4, 64, 20, 68, 320, 52, 84, 16448, 324, 832, 116, 1104, 308, 816, 340, 836, 848, 1108, 1136, 1360, 3152, 16708, 372, 5188, 5216, 852, 880, 2884, 1364, 13376, 1392, 3184, 3424, 17220, 5204, 5220, 2868, 5728, 884, 19536, 66896, 2900, 1396, 21572, 3188, 3412]

cp's OEIS Frontend

A367913 Least number k such that there are exactly n ways to choose a multiset consisting of a binary index of each binary index of k.

Table of values

List of values