A098197 - cp's OEIS frontend

A098197 Smallest number m such that the trajectory of m under iteration of cototient function[=A051953] contains exactly n distinct numbers (including m and the fixed point=0). Or: the required number of iterations[=operations,transitions] is n-1.

n	a(n)
1	0
2	1
3	2
4	4
5	6
6	10
7	18
8	30
9	42
10	78
11	114
12	186
13	294
14	390
15	582
16	798
17	1194
18	1950
19	2922
20	4074
21	5586
22	7770
23	11154
24	15810
25	22110
26	30702
27	42570
28	53130
29	68970
30	105090
31	159390
32	206910
33	278850
34	361410
35	462210
36	688722
37	1019202
38	1389810
39	2053770
40	3011850

[0, 1, 2, 4, 6, 10, 18, 30, 42, 78, 114, 186, 294, 390, 582, 798, 1194, 1950, 2922, 4074, 5586, 7770, 11154, 15810, 22110, 30702, 42570, 53130, 68970, 105090, 159390, 206910, 278850, 361410, 462210, 688722, 1019202, 1389810, 2053770, 3011850]

cp's OEIS Frontend

A098197 Smallest number m such that the trajectory of m under iteration of cototient function[=A051953] contains exactly n distinct numbers (including m and the fixed point=0). Or: the required number of iterations[=operations,transitions] is n-1.

Table of values

List of values