OFFSET
1,5
FORMULA
a(n) = prime(n) mod (2n-1).
EXAMPLE
a(1) = prime(1) mod odd(1) = 2 mod 1 = 0; a(5) = prime(5) mod odd(5) = 11 mod 9 = 2.
MAPLE
A192326 := proc(n) modp(ithprime(n), 2*n-1) ; end proc:
seq(A192326(n), n=1..80) ; # R. J. Mathar, Jul 13 2011
PROG
(MATLAB) % n = number of computed terms of sequence
for i=1:n,
a(n) = mod(prime(i), odd(i)) ;
end
(PARI) a(n)=prime(n)%(2*n-1) \\ Charles R Greathouse IV, Jun 29 2011
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Pasi Airikka, Jun 28 2011
STATUS
approved