login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A050780 (n + sopf_n = m) and (m - sopf_m = n). Sequence gives values of n. 2
39, 60, 70, 95, 119, 240, 2079, 2130, 2183, 3000, 3125, 3431, 4250, 6293, 6468, 9310, 10164, 10241, 10679, 13433, 14039, 14111, 15561, 16199, 16799, 23552, 24601, 27004, 28116, 28560, 31416, 32883, 42112, 44268, 52193, 52969, 53754, 59072 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

sopf_n = sum of the prime factors of n (with multiplicity).

EXAMPLE

E.g. 39 + (3+13) = 55 - (5+11) = 39.

MATHEMATICA

sopf[n_] := Total[Apply[Times, FactorInteger[n], {1}]]; ok[n_] := n + sopf[n] - sopf[n + sopf[n]] == n; Select[Range[59200], ok] (* From Jean-François Alcover, Apr 18 2011 *)

CROSSREFS

Cf. A050781, A050703-A050710.

Sequence in context: A156333 A116281 A168530 * A039353 A043176 A043956

Adjacent sequences:  A050777 A050778 A050779 * A050781 A050782 A050783

KEYWORD

nonn,nice

AUTHOR

Patrick De Geest (pdg(AT)worldofnumbers.com), Sep 15 1999.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 10:28 EST 2012. Contains 205763 sequences.