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

%I #4 Mar 30 2012 18:50:30

%S 1,4,9,10,16,21,22,25,28,33,34,40,45,46,49,52,55,57,58,64,69,70,76,81,

%T 82,85,88,93,94,100,105,106,112,115,117,118,121,124,129,130,136,141,

%U 142,145,148,153,154,160,161,165,166,169,172,175,177,178,184,189,190,196

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

%C A080063(m) = 1 iff m = a(k) for some k.

%Y Cf. A080065.

%K nonn

%O 1,2

%A _Reinhard Zumkeller_, Jan 24 2003