This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A226534 q + p - 1 mod q - p + 1 where p, q are consecutive primes. 1
 0, 1, 2, 2, 2, 4, 2, 1, 2, 2, 4, 2, 2, 4, 1, 6, 2, 1, 2, 2, 4, 1, 3, 5, 2, 2, 4, 2, 1, 14, 2, 1, 2, 1, 2, 6, 4, 4, 3, 1, 2, 8, 2, 4, 2, 6, 4, 4, 2, 1, 2, 2, 7, 3, 1, 6, 2, 1, 2, 2, 3, 14, 2, 2, 4, 2, 2, 1, 2, 1, 4, 5, 4, 2, 1, 1, 2, 2, 8, 2, 2, 4, 2, 3, 1, 2, 5, 2, 2, 4, 9, 2, 2, 8, 1, 3, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS p(n + 1) + p(n) - 1 mod p(n + 1) - p(n) + 1 where p(n) is n-th prime. LINKS FORMULA a(n) = A076273(n + 1) mod A076368(n + 1). EXAMPLE 0 is in the sequence because (3 + 2 - 1 mod 3 - 2 + 1) = (4 mod 2) = 0 where 2, 3 are consecutive primes. MATHEMATICA Table[Mod[Prime[p + 1] + Prime[p] - 1, Prime[p + 1] - Prime[p] + 1], {p, 100}] (* Alonso del Arte, Jan 18 2014 *) PROG (PARI) a(n)=lift(Mod(prime(n+1)+prime(n)-1, prime(n+1)-prime(n)+1)) /* Ralf Stephan, Sep 03 2013 */ CROSSREFS Sequence in context: A327987 A216650 A027387 * A138260 A027389 A111735 Adjacent sequences:  A226531 A226532 A226533 * A226535 A226536 A226537 KEYWORD nonn,easy AUTHOR Juri-Stepan Gerasimov, Aug 31 2013 STATUS approved

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

Last modified October 22 18:05 EDT 2019. Contains 328319 sequences. (Running on oeis4.)