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.

A328736 Numbers k such that at least one of sopfr(k-1) and sopfr(k+1) is greater than or equal to 2*sopfr(k).

This page as a plain text file.
%I A328736 #27 Dec 02 2019 13:51:19
%S A328736 16,18,20,24,28,30,32,36,40,42,44,45,48,52,54,60,63,66,68,70,72,75,78,
%T A328736 80,81,84,85,88,90,95,96,98,100,102,104,105,108,110,112,114,117,119,
%U A328736 121,125,126,128,130,132,133,135,136,138,140,143,144,145
%N A328736 Numbers k such that at least one of sopfr(k-1) and sopfr(k+1) is greater than or equal to 2*sopfr(k).
%C A328736 k-1 or k+1 or both have sums of prime factors at least twice the sum of prime factors of k.
%t A328736 sop[n_] := If[n<2, 0, Total[Times @@@ FactorInteger@ n]]; Select[ Range[2, 150], (s = 2 sop[#]; sop[#+1] >= s || sop[#-1] >= s) &] (* _Giovanni Resta_, Oct 27 2019 *)
%Y A328736 Cf. A001414, A328737, A328738.
%K A328736 nonn
%O A328736 1,1
%A A328736 _Robert Bilinski_, Oct 26 2019