login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A227203 Prime(n)^2 mod (prime(n) + prime(n+1)). 0
4, 1, 1, 13, 1, 19, 1, 25, 9, 1, 9, 43, 1, 49, 9, 9, 1, 9, 73, 1, 9, 85, 9, 109, 103, 1, 109, 1, 115, 49, 133, 9, 1, 25, 1, 9, 9, 169, 9, 9, 1, 25, 1, 199, 1, 241, 253, 229, 1, 235, 9, 1, 25, 9, 9, 9, 1, 9, 283, 1, 25, 49, 313, 1, 319, 49, 9, 25, 1, 355, 9, 379 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

a(n) = 1 if and only if prime(n) and prime(n+1) are twin prime pair (that is, prime(n+1) =  2 + prime(n)).

LINKS

Table of n, a(n) for n=1..72.

MATHEMATICA

Table[Mod[Prime[n]^2, Prime[n] + Prime[n + 1]], {n, 200}]

PowerMod[#[[1]], 2, Total[#]]&/@Partition[Prime[Range[80]], 2, 1] (* Harvey P. Dale, Dec 26 2017 *)

PROG

(PARI) for(n=1, 200, print1(prime(n)^2%(prime(n)+prime(n+1))", "))

CROSSREFS

Cf. A029707, A167770.

Sequence in context: A051433 A163366 A181145 * A140070 A158815 A101275

Adjacent sequences:  A227200 A227201 A227202 * A227204 A227205 A227206

KEYWORD

nonn

AUTHOR

Zak Seidov, Sep 18 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 18 12:16 EST 2019. Contains 329261 sequences. (Running on oeis4.)