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

A079008

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

Terms

    a(0) =1a(1) =2a(2) =5a(3) =11a(4) =11a(5) =17a(6) =17a(7) =37a(8) =46a(9) =46a(10) =112a(11) =112a(12) =123a(13) =149a(14) =149a(15) =149a(16) =257a(17) =257a(18) =257a(19) =257a(20) =257a(21) =257a(22) =257a(23) =261a(24) =658a(25) =658a(26) =685a(27) =741a(28) =741a(29) =1359

External references