|
%I #8 May 30 2012 00:40:37
%S 0,0,0,2,4,5,4,5,4,1,2,24,26,28,30,32,34,36,38,40,42,44,46,48,50,52,
%T 54,56,58,60,62,64,66,68,70,72,74,76,78,80,82,84,86,88,90,92,94,96,98,
%U 100,102,104,106,108,110,112,114,116,118,120,122,124,126,128
%N (prime(n) + n) mod (prime(n) - n).
%F a(n) = (p(n)+n) modulo (p(n)-n) = (2*n) modulo (p(n)-n).
%F a(n) = 2*n for n > 11 because prime(n) > 3*n for n > 11.
%t f[n_] := Block[{p = Prime[n]}, Mod[p + n, p - n]]; Array[f, 64] (* _Robert G. Wilson v_, May 27 2012 *)
%K nonn
%O 1,4
%A _Zak Seidov_, May 27 2012
|
