Smallest s > 0 such that Lpf(n) = Lpf(n+s) where Lpf(x) denotes the largest prime factor in x factorization.
A071829
Smallest s > 0 such that Lpf(n) = Lpf(n+s) where Lpf(x) denotes the largest prime factor in x factorization.
Terms
- a(0) =2a(1) =3a(2) =4a(3) =5a(4) =3a(5) =7a(6) =8a(7) =3a(8) =5a(9) =11a(10) =6a(11) =13a(12) =7a(13) =5a(14) =16a(15) =17a(16) =6a(17) =19a(18) =5a(19) =7a(20) =11a(21) =23a(22) =3a(23) =5a(24) =13a(25) =9a(26) =7a(27) =29a(28) =10a(29) =31
External references
- oeis: A071829