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.

A025584 Primes p such that p-2 is not a prime.

This page as a plain text file.
%I A025584 #39 Jul 08 2025 17:31:22
%S A025584 2,3,11,17,23,29,37,41,47,53,59,67,71,79,83,89,97,101,107,113,127,131,
%T A025584 137,149,157,163,167,173,179,191,197,211,223,227,233,239,251,257,263,
%U A025584 269,277,281,293,307,311,317,331,337,347,353,359,367,373,379,383,389,397,401
%N A025584 Primes p such that p-2 is not a prime.
%C A025584 Primes p (for p>=11) such that sigma(p-2) > p. - _Benoit Cloitre_, Feb 08 2002
%C A025584 Prime numbers that are not the sum of two smaller prime numbers. - _Tomas Xordan_, May 10 2007
%H A025584 Vincenzo Librandi, <a href="/A025584/b025584.txt">Table of n, a(n) for n = 1..10000</a>
%F A025584 a(n) ~ n log n. - _Charles R Greathouse IV_, Jan 10 2013
%t A025584 Select[ Prime /@ Range[100], ! PrimeQ[# - 2] &] (* _Jean-François Alcover_, Apr 19 2013 *)
%o A025584 (Magma) [p: p in PrimesUpTo(420) | not IsPrime(p-2)]; // _Vincenzo Librandi_, Jul 26 2013
%o A025584 (PARI) lista(nn) = forprime(p=2, nn, if (!isprime(p-2), print1(p, ", "));); \\ _Michel Marcus_, Dec 05 2015
%Y A025584 Complement of A006512 in A000040.
%Y A025584 Cf. A014092.
%K A025584 nonn,easy
%O A025584 1,1
%A A025584 _N. J. A. Sloane_
%E A025584 Better description from _Vladeta Jovovic_, Dec 14 2002