|
%I #20 Sep 08 2022 08:45:57
%S 0,3,5,7,1,1,3,3,5,9,9,13,15,15,17,21,25,25,29,31,31,35,37,41,47,49,
%T 49,51,51,53,3,3,5,3,9,7,9,11,11,13,15,13,19,17,17,15,23,31,31,29,29,
%U 31,29,35,37,39,41,39,41,41,39,45,55,55,53,53,63,65,71,69,69,71,75,77,79,79
%N a(n) = prime(n) mod 2*n.
%H Michel Marcus, <a href="/A192327/b192327.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = A000040(n) mod (2*n).
%e a(1) = prime(1) mod even(1) = 2 mod 2 = 0.
%e a(5) = prime(5) mod even(5) = 11 mod 10 = 1.
%p A192327 := proc(n) modp(ithprime(n),2*n) ; end proc:
%p seq(A192327(n),n=1..80) ; # _R. J. Mathar_, Jul 11 2011
%t Table[Mod[Prime[n], 2n], {n, 50}] (* _Alonso del Arte_, Jun 29 2011 *)
%o (MATLAB) % n = number of computed terms of sequence
%o for i=1:n,
%o a(i) = mod(prime(i),even(i)) ;
%o end
%o (PARI) a(n)=prime(n)%(2*n) \\ _Charles R Greathouse IV_, Jun 29 2011
%o (Magma) A192327:=func< n | NthPrime(n) mod 2*n >; [ A192327(n): n in [1..80] ]; // _Klaus Brockhaus_, Jul 10 2011
%Y Cf. A004648.
%K nonn,easy
%O 1,2
%A _Pasi Airikka_, Jun 28 2011
|
