login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A074054
Numbers n such that sum of composites from smallest prime factor of n to largest prime factor of n is prime.
1
22, 33, 44, 66, 88, 99, 106, 110, 132, 134, 154, 155, 159, 165, 176, 178, 198, 201, 202, 206, 212, 220, 231, 242, 264, 267, 268, 297, 303, 308, 309, 318, 330, 334, 352, 356, 363, 371, 396, 402, 404, 412, 413, 424, 440, 445, 462, 469, 477, 484, 493, 495, 501
OFFSET
1,1
LINKS
EXAMPLE
22=2*11 and sum of composites between 2 and 11 is: 4+6+8+9+10 = 37, prime.
MATHEMATICA
scpQ[n_]:=Module[{f=Transpose[FactorInteger[n]][[1]], a, b}, a = First[f]+ 1; b=Last[f]-1; PrimeQ[Total[Select[Range[a, b], !PrimeQ[#]&]]]]; Select[ Range[ 510], scpQ] (* Harvey P. Dale, May 07 2013 *)
CROSSREFS
Sequence in context: A190588 A072041 A067035 * A067287 A026044 A120146
KEYWORD
nonn
AUTHOR
Jason Earls, Sep 15 2002
STATUS
approved