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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A190104 Let sopfr(n) = A001414(n) denote the sum of the prime factors of n with multiplicity. The sequence lists numbers n such that if sopfr(n)=m and sopfr(m)=r, then n==r mod m with 0<r<m. 0
24, 57, 135, 168, 200, 222, 512, 575, 585, 713, 760, 781, 825, 854, 1161, 1360, 1475, 1484, 1485, 1504, 1780, 1872, 1960, 2415, 2444, 2535, 2784, 3087, 3096, 3168, 3216, 3250, 3360, 3404, 3531, 3596, 3844, 3850, 4235, 4240, 4410, 4437, 4512, 4514, 4810 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Trivial solutions with sopfr(n)=n and thus r=0 are excluded.

LINKS

Table of n, a(n) for n=1..45.

EXAMPLE

For sopfr(200)=2+2+2+5+5=16; 200=8 mod 16; and the sopfr(16)=2+2+2+2=8=r.

CROSSREFS

Cf. A001414.

Sequence in context: A211461 A208086 A232937 * A255968 A211325 A290303

Adjacent sequences:  A190101 A190102 A190103 * A190105 A190106 A190107

KEYWORD

nonn

AUTHOR

J. M. Bergot, May 04 2011

EXTENSIONS

Extended by Ray Chandler, May 11 2011

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 14 22:17 EST 2019. Contains 329134 sequences. (Running on oeis4.)