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.
%I A370156 #25 Feb 28 2025 15:18:17 %S A370156 11,41,53,71,113,131,179,251,311,449,491,521,593,599,683,701,719,773, %T A370156 809,881,941,1049,1061,1103,1151,1229,1301,1319,1373,1439,1499,1511, %U A370156 1571,1709,1733,1931,2273,2309,2393,2579,2591,2663,2843,2861,2903,3041,3119 %N A370156 Primes p such that (p-2)/3 is prime and 3*p+2 is composite. %C A370156 None of these primes are lucky (A000959). - _Davide Rotondo_, Feb 12 2025 %H A370156 Robert Israel, <a href="/A370156/b370156.txt">Table of n, a(n) for n = 1..10000</a> %e A370156 (11-2)/3 is a prime and 3*11+2 isn't. %p A370156 filter:= proc(p) isprime(p) and isprime((p-2)/3) and not isprime(3*p+2) end proc: %p A370156 select(filter, [seq(i,i=5..10000,6)]); # _Robert Israel_, Feb 28 2025 %t A370156 Select[Prime[Range[500]], ! PrimeQ[3 # + 2] && PrimeQ[(# - 2)/3] &] %o A370156 (PARI) isok(p) = if (isprime(p), !isprime(3*p+2) && (((p%3) == 2) && isprime((p-2)/3))); \\ _Michel Marcus_, Feb 17 2024 %Y A370156 Cf. A000040, A000959, A115058 (supersequence), A023208, A370157. %K A370156 nonn %O A370156 1,1 %A A370156 _Clark Kimberling_, Feb 10 2024