A357601 - cp's OEIS frontend

A357601 For n a power of 2, a(n) = n; otherwise, if 2^m is the greatest power of 2 not exceeding n and if k = n-2^m, then a(n) is the smallest number having d(a(k))+1 divisors which has not occurred earlier (d is the divisor counting function A000005).

n	a(n)
1	1
2	2
3	3
4	4
5	5
6	9
7	25
8	8
9	7
10	49
11	121
12	6
13	169
14	10
15	14
16	16
17	11
18	289
19	361
20	15
21	529
22	21
23	22
24	81
25	841
26	26
27	27
28	625
29	33
30	2401
31	14641
32	32
33	13
34	961
35	1369
36	34
37	1681
38	35
39	38
40	28561
41	1849
42	39
43	46
44	83521
45	51
46	130321
47	279841
48	12
49	2209
50	55
51	57
52	707281
53	58
54	923521
55	1874161
56	18

[1, 2, 3, 4, 5, 9, 25, 8, 7, 49, 121, 6, 169, 10, 14, 16, 11, 289, 361, 15, 529, 21, 22, 81, 841, 26, 27, 625, 33, 2401, 14641, 32, 13, 961, 1369, 34, 1681, 35, 38, 28561, 1849, 39, 46, 83521, 51, 130321, 279841, 12, 2209, 55, 57, 707281, 58, 923521, 1874161, 18]

cp's OEIS Frontend

A357601 For n a power of 2, a(n) = n; otherwise, if 2^m is the greatest power of 2 not exceeding n and if k = n-2^m, then a(n) is the smallest number having d(a(k))+1 divisors which has not occurred earlier (d is the divisor counting function A000005).

Table of values

List of values