A213634 n-[n/m], where m is the least nondivisor of n (as in A007978) and [ ] = floor.

1, 2, 2, 3, 3, 5, 4, 6, 5, 7, 6, 10, 7, 10, 8, 11, 9, 14, 10, 14, 11, 15, 12, 20, 13, 18, 14, 19, 15, 23, 16, 22, 17, 23, 18, 29, 19, 26, 20, 27, 21, 32, 22, 30, 23, 31, 24, 39, 25, 34, 26, 35, 27, 41, 28, 38, 29, 39, 30, 52, 31, 42, 32, 43, 33, 50, 34, 46, 35, 47, 36

Offset: 1

Author

Clark Kimberling, Jun 16 2012

Keywords

• nonn
• easy

Comments

If n is odd, a(n) = (n+1)/2. - Robert Israel, Oct 09 2016

Examples

			a(10) = 10 - [10/3] = 7.
		

Links

• Robert Israel, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A007978, A213633.

Programs

Maple

f:= proc(n) local m;
       for m from 2 do if n mod m <> 0 then return n - iquo(n,m) fi od
end proc:
map(f, [$1..100]); # Robert Israel, Oct 09 2016

Mathematica

(See A213633.)