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
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, 26, 27, 28, 28, 30, 30, 32, 33, 34, 35, 36, 36, 38, 39, 40, 40, 42, 42, 44, 45, 46, 45, 48, 48, 50, 51, 52, 52, 54, 54, 56, 57, 58, 56, 60, 60, 62, 63, 64, 64, 66, 66, 68 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
MATHEMATICA
(See A213633.)
PROG
(Python)
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
CROSSREFS
Cf. A213633.
Sequence in context: A124815 A081328 A179276 * A218443 A326035 A205787
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 03:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)