This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A103272 a(n)=prime(n-k)+prime(n) mod 4, where k=(1/2)*(prime(n+1)-prime(n)). 0
 1, 0, 2, 2, 0, 2, 0, 0, 0, 2, 2, 2, 0, 0, 2, 0, 0, 2, 2, 2, 2, 2, 0, 0, 2, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 0, 2, 0, 2, 2, 0, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 2, 2, 0, 2, 2, 0, 0, 2, 2, 0, 0, 2, 2, 2, 0, 0, 0, 0, 0, 2, 0, 0, 2, 2, 0, 0, 2, 0, 2, 0, 2, 2, 2, 2, 0, 2, 2, 2, 2, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,3 LINKS MATHEMATICA Do[k = (Prime[n+1] - Prime[n])/2; Print[Mod[Prime[n-k]+Prime[n], 4]], {n, 3, 100}] (Propper) CROSSREFS Sequence in context: A011289 A225678 A141720 * A065710 A089799 A073464 Adjacent sequences:  A103269 A103270 A103271 * A103273 A103274 A103275 KEYWORD nonn AUTHOR Yasutoshi Kohmoto (zbi74583(AT)boat.zero.ad.jp), Jan 27 2005 EXTENSIONS More terms from Ryan Propper (rpropper(AT)stanford.edu) and David Wasserman, Oct 07 2005 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 .

Last modified May 21 08:52 EDT 2013. Contains 225478 sequences.