Numbers n such that n == 3 modulo (spf(n)+1), where spf(m) is the smallest prime dividing m (A020639).

A080065

Numbers n such that n == 3 modulo (spf(n)+1), where spf(m) is the smallest prime dividing m (A020639).

Terms

    a(0) =3a(1) =15a(2) =27a(3) =39a(4) =51a(5) =63a(6) =75a(7) =87a(8) =91a(9) =99a(10) =111a(11) =123a(12) =135a(13) =147a(14) =159a(15) =171a(16) =183a(17) =195a(18) =203a(19) =207a(20) =219a(21) =231a(22) =243a(23) =255a(24) =259a(25) =267a(26) =279a(27) =291a(28) =303a(29) =315

External references