Grimm numbers (2): a(n) = largest k so that for each composite m in {n+1, n+2, ..., n+k} there corresponds a different divisor d_m with 1 < d_m < m.

A059751

Grimm numbers (2): a(n) = largest k so that for each composite m in {n+1, n+2, ..., n+k} there corresponds a different divisor d_m with 1 < d_m < m.

Terms

    a(0) =7a(1) =6a(2) =5a(3) =10a(4) =9a(5) =14a(6) =13a(7) =12a(8) =15a(9) =22a(10) =21a(11) =20a(12) =19a(13) =20a(14) =23a(15) =22a(16) =21a(17) =20a(18) =19a(19) =18a(20) =27a(21) =26a(22) =25a(23) =24a(24) =29a(25) =30a(26) =29a(27) =28a(28) =27a(29) =26

External references