This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A192326 Remainders of primes divided by odd numbers. 1
 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, 50, 52, 52, 54, 5, 5, 7, 5, 11, 9, 11, 13, 13, 15, 17, 15, 21, 19, 19, 17, 25, 33, 33, 31, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 LINKS 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 Cf. A131733. Sequence in context: A029940 A045674 A143483 * A131733 A128745 A188524 Adjacent sequences:  A192323 A192324 A192325 * A192327 A192328 A192329 KEYWORD nonn,easy,changed AUTHOR Pasi Airikka, Jun 28 2011 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .