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”).

A169802
Numbers k equal to A074036(k) = sum of primes from least to largest prime factor.
3
2, 3, 5, 7, 10, 11, 13, 17, 19, 23, 29, 31, 37, 39, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 155, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271
OFFSET
1,1
COMMENTS
Union of primes (A000040) and A055233.
MATHEMATICA
upto=500; a={}; Do[f=Map[First, FactorInteger[k]]; If[k==Total[Select[Range[First[f], Last[f]], PrimeQ]], AppendTo[a, k]], {k, upto}]; a (* Paolo Xausa, Nov 27 2021 *)
PROG
(PARI) select( {is_A169802(n, f=factor(n)[, 1])=n>1&&n==vecsum(primes([f[1], f[#f]]))}, [1..222]) \\ M. F. Hasler, Nov 24 2021
CROSSREFS
Cf. A055233 (this without primes), A074036 (sum of primes from spf(n) to gpf(n)).
Cf. A020639 (spf: smallest prime factor), A006530 (gpf: greatest prime factor).
Sequence in context: A324813 A235050 A117286 * A194948 A266679 A285257
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, May 24 2010
STATUS
approved