The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A046363 Composite numbers whose sum of prime factors (with multiplicity) is prime. 20
 6, 10, 12, 22, 28, 34, 40, 45, 48, 52, 54, 56, 58, 63, 75, 76, 80, 82, 88, 90, 96, 99, 104, 108, 117, 118, 136, 142, 147, 148, 153, 165, 172, 175, 176, 184, 198, 202, 207, 210, 214, 224, 245, 248, 250, 252, 268, 273, 274, 279, 294, 296, 298, 300, 316, 320, 325 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS If prime numbers were included the sequence would be 2, 3, 5, 6, 7, 10, 11, 12, 13, 17, 19, 22, 23, 28, 29, ... which is A100118. - Hieronymus Fischer, Oct 20 2007 Conjecture: a(n) can be approximated with the formula c*n^k, where c is approximately 0.46 and k is approximately 1.05. - Elijah Beregovsky, May 01 2019 The ternary Goldbach Conjecture implies that this sequence contains infinitely many terms of A014612 (triprimes). - Elijah Beregovsky, Dec 17 2019 A proof that this sequence is infinite: There are infinitely many odd primes, let p2 > p1 > 2 be two odd primes, p2-p1=2*k  then (2^k)*p1 is a term because 2*k+p1=p2 is prime. For example: 5+6=11, 6=2*3, 2^3*5=40 is a term. - Metin Sariyar, Dec 17 2019 LINKS Robert Israel, Table of n, a(n) for n = 1..10000 FORMULA A100118 INTERSECT A002808. - R. J. Mathar, Sep 09 2015 EXAMPLE 214 = 2 * 107 -> Sum of factors is 109 -> 109 is prime. MAPLE ifac := proc (n) local L, x: L := ifactors(n): map(proc (x) options operator, arrow: seq(x, j = 1 .. x) end proc, L) end proc: a := proc (n) if isprime(n) = false and isprime(add(t, t = ifac(n))) = true then n else end if end proc: seq(a(n), n = 1 .. 350); # with help from W. Edwin Clark - Emeric Deutsch, Jan 21 2009 MATHEMATICA PrimeFactorsAdded[n_] := Plus @@ Flatten[Table[ #[]*#[], {1}] & /@ FactorInteger[n]]; GenerateA046363[n_] := Select[Range[n], PrimeQ[PrimeFactorsAdded[ # ]] && PrimeQ[ # ] == False &]; (* GenerateA046363 would give all elements of this sequence below 100. - Ryan Witko (witko(AT)nyu.edu), Mar 08 2004 *) Select[Range, !PrimeQ[#] && PrimeQ[Total[Times@@@FactorInteger[#]]]&] (* Jayanta Basu, May 29 2013 *) PROG (PARI) is(n)=if(isprime(n), return(0)); my(f=factor(n)); isprime(sum(i=1, #f~, f[i, 1]*f[i, 2])) \\ Charles R Greathouse IV, Sep 21 2013 (MAGMA) f:=func; [k:k in [2..350]| not IsPrime(k) and IsPrime(f(k))]; // Marius A. Burtea, Dec 17 2019 CROSSREFS Cf. A046364, A046365, A100118, A000040, A002808, A066038, A001414. Sequence in context: A315137 A315138 A315139 * A101086 A297620 A074924 Adjacent sequences:  A046360 A046361 A046362 * A046364 A046365 A046366 KEYWORD nonn AUTHOR Patrick De Geest, Jun 15 1998 EXTENSIONS Edited by R. J. Mathar, Nov 02 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 24 22:57 EST 2020. Contains 338616 sequences. (Running on oeis4.)