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.
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!)
A275468 Least k such that d(k*n^2) = d(n*k^2) where d = A000005. 1
1, 2, 2, 4, 2, 6, 2, 8, 4, 6, 2, 12, 2, 6, 6, 16, 2, 12, 2, 12, 6, 6, 2, 24, 4, 6, 8, 12, 2, 30, 2, 6, 6, 6, 6, 36, 2, 6, 6, 24, 2, 30, 2, 12, 18, 6, 2, 45, 4, 18, 6, 12, 2, 24, 6, 24, 6, 6, 2, 60, 2, 6, 18, 64, 6, 30, 2, 12, 6, 30, 2, 72, 2, 6, 12, 12, 6, 30, 2, 48, 16, 6, 2, 60, 6, 6, 6, 24 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Numbers n such that a(n) is different from A046523(n) are 32, 45, 48, 50, 63, ...
LINKS
EXAMPLE
a(32) = 6 because A000005(6*32^2) = A000005(32*6^2).
PROG
(PARI) a(n) = {my(k = 1); while (numdiv(k*n^2) != numdiv(n*k^2), k++); k; }
CROSSREFS
Sequence in context: A364949 A083260 A284011 * A046523 A278524 A278523
KEYWORD
nonn
AUTHOR
Altug Alkan, Jul 28 2016
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 May 15 09:20 EDT 2024. Contains 372540 sequences. (Running on oeis4.)