%I #15 Feb 26 2019 23:05:53
%S 0,0,0,0,2,2,4,4,6,10,10,14,16,16,18,22,26,26,30,32,32,36,38,42,48,50,
%T 50,52,52,54,5,5,7,5,11,9,11,13,13,15,17,15,21,19,19,17,25,33,33,31,
%U 31,33,31,37,39,41,43,41,43,43,41,47,57,57,55,55,65,67,73,71,71,73,77,79,81,81,83
%N Remainders of primes divided by odd numbers.
%F a(n) = prime(n) mod (2n-1).
%e a(1) = prime(1) mod odd(1) = 2 mod 1 = 0; a(5) = prime(5) mod odd(5) = 11 mod 9 = 2.
%p A192326 := proc(n) modp(ithprime(n),2*n-1) ; end proc:
%p seq(A192326(n),n=1..80) ; # _R. J. Mathar_, Jul 13 2011
%o (MATLAB) % n = number of computed terms of sequence
%o for i=1:n,
%o a(n) = mod(prime(i),odd(i)) ;
%o end
%o (PARI) a(n)=prime(n)%(2*n-1) \\ _Charles R Greathouse IV_, Jun 29 2011
%Y Cf. A131733.
%K nonn,easy
%O 1,5
%A _Pasi Airikka_, Jun 28 2011