A079008 - cp's OEIS frontend

A079008 a(n) is smallest number k such that the n successive values of phi(k+j) (j=0,..,n-1) are all distinct.

n	a(n)
1	1
2	2
3	5
4	11
5	11
6	17
7	17
8	37
9	46
10	46
11	112
12	112
13	123
14	149
15	149
16	149
17	257
18	257
19	257
20	257
21	257
22	257
23	257
24	261
25	658
26	658
27	685
28	741
29	741
30	1359
31	1359
32	1359
33	1359
34	1359
35	1359
36	1359
37	1359
38	1359
39	1359
40	1359
41	1359
42	1359
43	1359
44	1359
45	1359
46	4097
47	4097
48	4097
49	4097
50	4097

[1, 2, 5, 11, 11, 17, 17, 37, 46, 46, 112, 112, 123, 149, 149, 149, 257, 257, 257, 257, 257, 257, 257, 261, 658, 658, 685, 741, 741, 1359, 1359, 1359, 1359, 1359, 1359, 1359, 1359, 1359, 1359, 1359, 1359, 1359, 1359, 1359, 1359, 4097, 4097, 4097, 4097, 4097]

cp's OEIS Frontend

A079008 a(n) is smallest number k such that the n successive values of phi(k+j) (j=0,..,n-1) are all distinct.

Table of values

List of values