login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A213635 m*[n/m], where m is the least nondivisor of n (as in A007978) and [ ] = floor. 3

%I #7 Feb 22 2023 18:14:50

%S 0,0,2,3,4,4,6,6,8,9,10,10,12,12,14,15,16,16,18,18,20,21,22,20,24,24,

%T 26,27,28,28,30,30,32,33,34,35,36,36,38,39,40,40,42,42,44,45,46,45,48,

%U 48,50,51,52,52,54,54,56,57,58,56,60,60,62,63,64,64,66,66,68

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

%t (See A213633.)

%o (Python)

%o def A213635(n): return n-next(filter(None, (n%d for d in range(2,n)))) if n>2 else 0 # _Chai Wah Wu_, Feb 22 2023

%Y Cf. A213633.

%K nonn,easy

%O 1,3

%A _Clark Kimberling_, Jun 16 2012

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 20 03:42 EDT 2024. Contains 375310 sequences. (Running on oeis4.)