cp's OEIS Frontend

A022465 Numbers n such that prime(n) mod n <= 10.

%I A022465 #20 Aug 29 2018 17:33:07
%S A022465 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,21,31,32,33,34,35,36,
%T A022465 37,69,73,74,75,76,77,78,79,80,181,191,443,445,1052,2701,2703,6455,
%U A022465 6456,6457,6459,6460,6466,15928,15929,16055,40073,40078,40080,40081,40082,40083,40122
%N A022465 Numbers n such that prime(n) mod n <= 10.
%C A022465 a(96) > 5*10^6. - _Robert Israel_, Aug 29 2018
%H A022465 Giovanni Resta, <a href="/A022465/b022465.txt">Table of n, a(n) for n = 1..216</a> (first 95 terms from Robert Israel)
%p A022465 Res:= NULL; p:= 1; count:= 0:
%p A022465 for n from 1 while count < 80 do
%p A022465   p:= nextprime(p);
%p A022465   if p mod n <= 10 then count:=count+1; Res:= Res, n;
%p A022465   fi
%p A022465 od:
%p A022465 Res; # _Robert Israel_, Aug 29 2018
%t A022465 Select[Range[41000],Mod[Prime[#],#]<=10&] (* _Harvey P. Dale_, Aug 21 2011 *)
%Y A022465 Cf. A038624.
%K A022465 nonn
%O A022465 1,2
%A A022465 _Clark Kimberling_
%E A022465 More terms from _David W. Wilson_
%E A022465 More terms from _Robert Israel_, Aug 29 2018