A058213 - cp's OEIS frontend

A058213 Triangular arrangement of solutions of phi(x) = 2^n (n >= 0), where phi=A000010 is Euler's totient function. Each row corresponds to a particular n and its length is n+2 for 0 <= n <= 31, 32 for n >= 32. (This assumes that there are only 5 Fermat primes.)

n	a(n)
0	1
1	2
2	3
3	4
4	6
5	5
6	8
7	10
8	12
9	15
10	16
11	20
12	24
13	30
14	17
15	32
16	34
17	40
18	48
19	60
20	51
21	64
22	68
23	80
24	96
25	102
26	120
27	85
28	128
29	136
30	160
31	170
32	192
33	204
34	240
35	255
36	256
37	272
38	320
39	340
40	384
41	408
42	480
43	510
44	257
45	512
46	514
47	544
48	640
49	680
50	768
51	816
52	960
53	1020
54	771
55	1024
56	1028
57	1088

[1, 2, 3, 4, 6, 5, 8, 10, 12, 15, 16, 20, 24, 30, 17, 32, 34, 40, 48, 60, 51, 64, 68, 80, 96, 102, 120, 85, 128, 136, 160, 170, 192, 204, 240, 255, 256, 272, 320, 340, 384, 408, 480, 510, 257, 512, 514, 544, 640, 680, 768, 816, 960, 1020, 771, 1024, 1028, 1088]

cp's OEIS Frontend

A058213 Triangular arrangement of solutions of phi(x) = 2^n (n >= 0), where phi=A000010 is Euler's totient function. Each row corresponds to a particular n and its length is n+2 for 0 <= n <= 31, 32 for n >= 32. (This assumes that there are only 5 Fermat primes.)

Table of values

List of values