The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A160656 The odd prime numbers together with 0: p - (-1)^p - 1 where p = n-th prime. 1
 0, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Table of n, a(n) for n=1..59. FORMULA a(n) = p - (-1)^p - 1 where p is the n-th prime. a(n) = p mod n^2, where p is the n-th prime. - Gary Detlefs, Jan 14 2012 MAPLE seq(ithprime(n) mod n^2, n=1..59) # Gary Detlefs, Jan 14 2012 PROG (PARI) a(n)=if(n>1, prime(n)) \\ Charles R Greathouse IV, Aug 26 2011 CROSSREFS Cf. A000040, A006005, A158611. Sequence in context: A073579 A006005 A065091 * A176997 A240699 A065380 Adjacent sequences: A160653 A160654 A160655 * A160657 A160658 A160659 KEYWORD nonn,easy,less AUTHOR Juri-Stepan Gerasimov, May 23 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 6 18:25 EST 2023. Contains 367614 sequences. (Running on oeis4.)