The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A109958 Concatenate n and the sum of primes dividing n (counting multiplicity). 2
 10, 22, 33, 44, 55, 65, 77, 86, 96, 107, 1111, 127, 1313, 149, 158, 168, 1717, 188, 1919, 209, 2110, 2213, 2323, 249, 2510, 2615, 279, 2811, 2929, 3010, 3131, 3210, 3314, 3419, 3512, 3610, 3737, 3821, 3916, 4011, 4141, 4212, 4343, 4415, 4511, 4625, 4747 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Robert Israel, Table of n, a(n) for n = 1..10000 FORMULA a(n) = 10^(A055652(A001414(n)))*n+A001414(n). - Robert Israel, Jun 26 2018 MAPLE f:= proc(n) local q; q:= add(t[1]*t[2], t=ifactors(n)[2]); 10^(1+ilog10(q))*n+q end proc: f(1):= 10: map(f, [\$1..100]); # Robert Israel, Jun 26 2018 CROSSREFS Cf. A001414, A109959. Sequence in context: A007366 A302280 A350627 * A053361 A214153 A179887 Adjacent sequences: A109955 A109956 A109957 * A109959 A109960 A109961 KEYWORD easy,nonn,base AUTHOR Jason Earls, Jul 06 2005 STATUS approved

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

Last modified December 1 23:44 EST 2022. Contains 358485 sequences. (Running on oeis4.)