cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

User: Shannon Jacobs

Shannon Jacobs's wiki page.

Shannon Jacobs has authored 1 sequences.

A280314 Relationship of prime numbers to multiples of 6. The value of a(n) = 2 if n*6 has two neighboring primes, a(n) = 1 if only n*6+1 is prime, a(n) = -1 if only n*6-1 is prime, and a(n) = 0 if the neighbors of n*6 are both composite.

Original entry on oeis.org

2, 2, 2, -1, 2, 1, 2, -1, -1, 2, 1, 2, 1, -1, -1, 1, 2, 2, -1, 0, 1, -1, 2, 0, 2, 1, 1, -1, -1, 2, 0, 2, 2, 0, 1, 0, 1, 2, -1, 2, 0, -1, -1, -1, 2, 1, 2, 0, -1, 0, 1, 2, -1, 0, 1, 1, 0, 2, -1, -1, 1, 1, 1, -1, -1, 1, -1, 1, 0, 2, 0, 2, 1, -1, -1, 1, 2, -1, 0, -1, 1, -1, 1, -1, -1, 0, 2, 0, 0, 1, 1
Offset: 1

Author

Shannon Jacobs, Dec 31 2016

Keywords

Comments

The number of 2's will decrease and the number of 0's will increase as n increases. If there is any pattern (even a local pattern), then the sequence will generate prime numbers, so I predict the values of the sequence have no pattern.

Examples

			From _Michael De Vlieger_, Dec 31 2016: (Start)
a(1) = 2 since both 1(6)-1 = 5 and 1(6)+1 = 7 are prime.
a(4) = -1 since only 4(6)-1 = 23 is prime; 4(6)+1 = 25 is divisible by 5.
a(20) = 0 since neither 20(6)-1 = 119 nor 20(6)+1 = 121 are prime.
(End)
		

Crossrefs

Programs

  • Mathematica
    Table[If[Times @@ Abs@ # == 1, Total@ Abs@ #, Total@ #] &[{-1, 1} Boole@ Map[PrimeQ, n + {-1, 1}]], {n, 6, 546, 6}] (* Michael De Vlieger, Dec 31 2016 *)