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!)
A336642 One less than the largest square dividing n: a(n) = A008833(n)-1. 4
0, 0, 0, 3, 0, 0, 0, 3, 8, 0, 0, 3, 0, 0, 0, 15, 0, 8, 0, 3, 0, 0, 0, 3, 24, 0, 8, 3, 0, 0, 0, 15, 0, 0, 0, 35, 0, 0, 0, 3, 0, 0, 0, 3, 8, 0, 0, 15, 48, 24, 0, 3, 0, 8, 0, 3, 0, 0, 0, 3, 0, 0, 8, 63, 0, 0, 0, 3, 0, 0, 0, 35, 0, 0, 24, 3, 0, 0, 0, 15, 80, 0, 0, 3, 0, 0, 0, 3, 0, 8, 0, 3, 0, 0, 0, 15, 0, 48, 8, 99, 0, 0, 0, 3, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
PROG
(PARI) A336642(n) = ((n/core(n))-1);
CROSSREFS
Cf. A008833.
Cf. also A336551, A336641, A336644.
Sequence in context: A117980 A065032 A007514 * A151671 A267502 A296605
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jul 28 2020
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 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)