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.

A246858 Composite numbers k such that sigma(k + sigma(k)) = 2*sigma(k).

This page as a plain text file.
%I A246858 #15 Sep 08 2022 08:46:09
%S A246858 329,413,623,869,979,1819,2585,3107,3173,3197,3887,4235,4997,5771,
%T A246858 6149,6187,6443,7409,8399,8759,14429,15323,18515,19019,21181,21413,
%U A246858 23989,26491,29749,30355,31043,32623,34009,34177,39737,47321,47845,51389,53311,56419
%N A246858 Composite numbers k such that sigma(k + sigma(k)) = 2*sigma(k).
%C A246858 Complement of A005384 (Sophie Germain primes) with respect to A246857.
%e A246858 Number 329 (with sigma(329) = 384) is in sequence because sigma(329 + sigma(329)) = sigma(713) = 768 = 2*384.
%t A246858 Select[Range[57000], And[CompositeQ[#], DivisorSigma[1, # + DivisorSigma[1, #]] == 2 DivisorSigma[1, #]] &] (* _Michael De Vlieger_, Aug 05 2021 *)
%o A246858 (Magma) [n:n in[1..1000] | SumOfDivisors(n+SumOfDivisors(n)) eq 2*SumOfDivisors(n) and not IsPrime(n)]
%o A246858 (PARI) lista(nn) = {forcomposite(n=2, nn, if (sigma(n+sigma(n)) == 2*sigma(n), print1(n, ", ")););} \\ _Michel Marcus_, Sep 05 2014
%Y A246858 Cf. A074400, A246456.
%Y A246858 Cf. A005384, A246858.
%K A246858 nonn
%O A246858 1,1
%A A246858 _Jaroslav Krizek_, Sep 05 2014