|
%I #4 Mar 31 2012 14:42:50
%S 0,0,0,0,0,0,0,0,0,17,19,27,29,27,33,39,47,49,55,59,19,61,65,15,29,31,
%T 31,29,29,89,23,113,41,121,15,27,47,21,17,31,15,33,61,25,57,57,193,71,
%U 43,31,43,221,73,233,27,83,257,37,29,51,51,21,11,97,289,41,313,107,67
%N a(n) = smallest k such that prime(n+3) = prime(n) + (prime(n) mod k), or 0 if no such k exists.
%H Remi Eismann, <a href="/A133347/b133347.txt">Table of n, a(n) for n = 1..10000</a>
%e For n = 1 we have prime(n) = 2, prime(n+3) = 7; there is no k such that 7 - 2 = 5 = (2 mod k), hence a(1) = 0.
%e For n = 10 we have prime(n) = 29, prime(n+3) = 41; 17 is the smallest k such that 41 - 29 = 12 = (29 mod k), hence a(10) = 17.
%e For n = 53 we have prime(n) = 241, prime(n+3) = 263; 73 is the smallest k such that 263 - 241 = 22 = (241 mod k), hence a(53) = 73.
%Y Cf. A000040, A117078, A117563, A001223, A118534, A020639, A090369, A090368, A130533, A130650, A130703, A130889, A130882.
%K nonn
%O 1,10
%A _Rémi Eismann_, Oct 20 2007
|
