The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS If n is odd, a(n) = (n+1)/2. - Robert Israel, Oct 09 2016 LINKS Robert Israel, Table of n, a(n) for n = 1..10000 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 Cf. A007978, A213633. Sequence in context: A307815 A070230 A007150 * A300271 A252461 A323608 Adjacent sequences: A213631 A213632 A213633 * A213635 A213636 A213637 KEYWORD nonn,easy AUTHOR Clark Kimberling, Jun 16 2012 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 May 20 10:39 EDT 2024. Contains 372712 sequences. (Running on oeis4.)