A341339 - cp's OEIS frontend

A341339 Square array read by descending antidiagonals where the row n (n >= 2) and column k (k >= 1) contains the largest number not greater than 2^k that has exactly n divisors, or 0 if such a number does not exist.

n	a(n)
2	2
3	3
4	0
5	7
6	4
7	0
8	13
9	4
10	0
11	0
12	31
13	9
14	8
15	0
16	0
17	61
18	25
19	15
20	0
21	0
22	0
23	127
24	49
25	27
26	16
27	0
28	0
29	0
30	251
31	121
32	62
33	16
34	12
35	0
36	0
37	0
38	509
39	169
40	125
41	16
42	32
43	0
44	0
45	0
46	0
47	1021
48	361
49	254
50	81
51	63
52	0
53	0
54	0
55	0
56	0
57	2039
58	961
59	511
60	81
61	124
62	64
63	30
64	0
65	0
66	0
67	0
68	4093
69	1849
70	1018
71	81
72	245
73	64
74	56
75	0
76	0
77	0
78	0
79	0

[2, 3, 0, 7, 4, 0, 13, 4, 0, 0, 31, 9, 8, 0, 0, 61, 25, 15, 0, 0, 0, 127, 49, 27, 16, 0, 0, 0, 251, 121, 62, 16, 12, 0, 0, 0, 509, 169, 125, 16, 32, 0, 0, 0, 0, 1021, 361, 254, 81, 63, 0, 0, 0, 0, 0, 2039, 961, 511, 81, 124, 64, 30, 0, 0, 0, 0, 4093, 1849, 1018, 81, 245, 64, 56, 0, 0, 0, 0, 0]

cp's OEIS Frontend

A341339 Square array read by descending antidiagonals where the row n (n >= 2) and column k (k >= 1) contains the largest number not greater than 2^k that has exactly n divisors, or 0 if such a number does not exist.

Table of values

List of values