Grimm numbers (1): a(n) = largest k so that for each m in {n+1, n+2, ..., n+k} there corresponds a different prime factor p_m.
A059686
Grimm numbers (1): a(n) = largest k so that for each m in {n+1, n+2, ..., n+k} there corresponds a different prime factor p_m.
Terms
- a(0) =2a(1) =3a(2) =4a(3) =4a(4) =3a(5) =5a(6) =4a(7) =6a(8) =6a(9) =7a(10) =6a(11) =7a(12) =6a(13) =5a(14) =8a(15) =8a(16) =7a(17) =8a(18) =7a(19) =7a(20) =8a(21) =7a(22) =6a(23) =7a(24) =9a(25) =8a(26) =8a(27) =11a(28) =10a(29) =11
External references
- oeis: A059686