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.

A249486 Nonprime numbers n such that sigma(n) + n is prime.

This page as a plain text file.
%I A249486 #12 Sep 08 2022 08:46:10
%S A249486 1,4,8,16,21,27,35,36,55,57,63,64,65,75,77,85,98,100,111,119,125,128,
%T A249486 133,143,144,155,161,171,183,189,203,205,209,215,235,237,242,243,245,
%U A249486 253,259,275,291,301,305,323,324,333,335,338,343,351,355,365,377,391
%N A249486 Nonprime numbers n such that sigma(n) + n is prime.
%C A249486 Complement of A005384 (Sophie Germain primes) with respect to A078762 (numbers n such that n + sigma(n) is prime).
%e A249486 Number 8 is in sequence because sigma(8)+8 = 15+8 = 23 (prime).
%p A249486 select(n -> not isprime(n) and isprime(n + numtheory:-sigma(n)), [$1..1000]); # _Robert Israel_, Nov 13 2014
%t A249486 Select[Range[500], PrimeQ[DivisorSigma[1, #] + #]&& !PrimeQ[#] &] (* _Vincenzo Librandi_, Nov 14 2014 *)
%o A249486 (Magma) [n: n in[1..10000] | IsPrime(SumOfDivisors(n)+ n) and not IsPrime(n) ]
%o A249486 (PARI) print1(1,", ");forcomposite(n=1,1000,if(isprime(sigma(n)+n),print1(n,", "))) \\ _Derek Orr_, Nov 13 2014
%Y A249486 Cf. A000040, A000203, A018252, A005384, A078762.
%K A249486 nonn,easy
%O A249486 1,2
%A A249486 _Jaroslav Krizek_, Nov 13 2014