A003271 - cp's OEIS frontend

A003271 Smallest number that requires n iterations of the unitary totient function (A047994) to reach 1.

n	a(n)
0	1
1	2
2	3
3	4
4	5
5	9
6	16
7	17
8	41
9	83
10	113
11	137
12	257
13	773
14	977
15	1657
16	2048
17	2313
18	4001
19	5725
20	7129
21	11117
22	17279
23	19897
24	22409
25	39283
26	43657
27	55457
28	120677
29	308941
30	314521
31	465089
32	564353
33	797931
34	1110841
35	1310443
36	1924159
37	2535041
38	3637637
39	6001937
40	8319617
41	9453569
42	10969369

[1, 2, 3, 4, 5, 9, 16, 17, 41, 83, 113, 137, 257, 773, 977, 1657, 2048, 2313, 4001, 5725, 7129, 11117, 17279, 19897, 22409, 39283, 43657, 55457, 120677, 308941, 314521, 465089, 564353, 797931, 1110841, 1310443, 1924159, 2535041, 3637637, 6001937, 8319617, 9453569, 10969369]

cp's OEIS Frontend

A003271 Smallest number that requires n iterations of the unitary totient function (A047994) to reach 1.

Table of values

List of values