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.

A332772 Numbers k > 0 such that 30k +- 7 is prime.

This page as a plain text file.
%I A332772 #40 Sep 06 2023 13:41:07
%S A332772 1,2,3,4,9,10,12,13,15,19,20,25,26,29,32,33,37,41,43,48,52,53,54,58,
%T A332772 66,67,76,78,81,85,88,89,90,92,95,97,101,107,118,120,121,128,129,134,
%U A332772 143,150,153,155,165,166,172,178,180,194,195,202,207,209,211,212
%N A332772 Numbers k > 0 such that 30k +- 7 is prime.
%C A332772 Looking for prime factors > 5=prime(3) in 8=A005867(3) candidates mod 30=A002110(3) two candidates in the form 30k +- 7 with k > 0 never belong to a twin prime pair. Twin primes can be (30k-13, 30k-11) A331840, (30k-1, 30k +1) A176114, or (30k+11, 30k+13) A089160.
%H A332772 Frank Ellermann, <a href="/A005867/a005867.txt">Illustration for A002110, A005867, A038110, A060753</a>
%e A332772 a(4)=4 for prime(30)=113=4*30-7 and prime(31)=127=4*30+7.
%e A332772 a(5)=9 for prime(56)=263=9*30-7 and prime(59)=277=9*30+7.
%t A332772 Select[Range@ 215, AllTrue[30 # + {-7, 7}, PrimeQ] &] (* _Michael De Vlieger_, Feb 25 2020 *)
%o A332772 (Rexx)
%o A332772 S = 1
%o A332772 do N = 2 while length( S ) < 255
%o A332772    if NOPRIME( N * 30 + 7 )   then  iterate N
%o A332772    if NOPRIME( N * 30 - 7 )   then  iterate N
%o A332772    S = S || ',' N
%o A332772 end N
%o A332772 say S
%Y A332772 Cf. A000040, A002110, A005867, A089160, A176114, A331840.
%Y A332772 Subsequence of A158573. Prime pairs 30k +- 7 in A329262.
%K A332772 nonn,easy
%O A332772 1,2
%A A332772 _Frank Ellermann_, Feb 25 2020