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.

Showing 1-1 of 1 results.

A323139 Integers that are not multiples of 6 and are the sum of two consecutive primes.

Original entry on oeis.org

5, 8, 52, 68, 100, 112, 128, 152, 172, 268, 308, 320, 340, 352, 410, 434, 472, 508, 520, 532, 548, 668, 712, 740, 752, 772, 872, 892, 946, 1012, 1030, 1064, 1088, 1120, 1132, 1148, 1180, 1192, 1208, 1220, 1250, 1300, 1312, 1334, 1360, 1460, 1472, 1508, 1606, 1888, 1900, 1948, 1960, 1988, 2006, 2032, 2072, 2132, 2156
Offset: 1

Views

Author

Pedro Caceres, Jan 05 2019

Keywords

Comments

All primes, except 2 and 3, are of the form 6k+1 or 6k-1 for k a positive integer. The converse statement is not true for all k, so the sum of two consecutive primes is not always a multiple of 6. This sequence lists the sums of two consecutive primes that are not multiple of 6.

Examples

			52 = 23 + 29 is not a multiple of 6.
		

Crossrefs

Programs

  • Maple
    p:= 2:
    count:= 0: Res:= NULL:
    while count < 100 do
      q:= nextprime(p);
      if p+q mod 6 <> 0 then
         count:= count+1; Res:= Res, p+q;
      fi;
      p:= q;
    od:
    Res; # Robert Israel, Jan 09 2019
  • Mathematica
    Select[Total /@ Partition[Prime@ Range@ 180, 2, 1], Mod[#, 6] != 0 &] (* Michael De Vlieger, Jan 07 2019 *)
  • PARI
    my(p=2); forprime(q=3, 1e3, if ((p+q) % 6, print1(p+q", ")); p=q); \\ Michel Marcus, Jan 05 2019
Showing 1-1 of 1 results.