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

A213634
n-[n/m], where m is the least nondivisor of n (as in A007978) and [ ] = floor.
3
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,2
COMMENTS
If n is odd, a(n) = (n+1)/2. - Robert Israel, Oct 09 2016
LINKS
EXAMPLE
a(10) = 10 - [10/3] = 7.
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.)
CROSSREFS
Sequence in context: A307815 A070230 A007150 * A300271 A252461 A323608
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Jun 16 2012
STATUS
approved