Numbers n such that n == 1 modulo (spf(n)+1), where spf(m) is the smallest prime dividing m (A020639).
A080064
Numbers n such that n == 1 modulo (spf(n)+1), where spf(m) is the smallest prime dividing m (A020639).
Terms
- a(0) =1a(1) =4a(2) =9a(3) =10a(4) =16a(5) =21a(6) =22a(7) =25a(8) =28a(9) =33a(10) =34a(11) =40a(12) =45a(13) =46a(14) =49a(15) =52a(16) =55a(17) =57a(18) =58a(19) =64a(20) =69a(21) =70a(22) =76a(23) =81a(24) =82a(25) =85a(26) =88a(27) =93a(28) =94a(29) =100
External references
- oeis: A080064