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!)
A366374 a(n) = n / gcd(n, A332214(n)), where A332214 is the Mersenne-prime fixing variant of permutation A163511. 5
0, 1, 1, 1, 1, 5, 1, 1, 1, 1, 5, 11, 1, 13, 1, 3, 1, 17, 1, 19, 5, 1, 11, 23, 1, 25, 13, 27, 1, 29, 3, 1, 1, 11, 17, 5, 1, 37, 19, 39, 5, 41, 1, 43, 11, 3, 23, 47, 1, 7, 25, 51, 13, 53, 27, 11, 1, 19, 29, 59, 3, 61, 1, 63, 1, 65, 11, 67, 17, 23, 5, 71, 1, 73, 37, 3, 19, 77, 39, 79, 5, 3, 41, 83, 1, 17, 43, 87, 11, 89 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,6
COMMENTS
Numerator of n / A332214(n).
LINKS
FORMULA
a(n) = n / A366373(n) = n / gcd(n, A332214(n)).
PROG
(PARI) A366374(n) = (n/gcd(n, A332214(n)));
CROSSREFS
Cf. A332214, A366372, A366373, A366375 (denominators), A366376.
Cf. also A364491, A366284.
Sequence in context: A170825 A140214 A343431 * A071020 A046601 A101025
KEYWORD
nonn,frac
AUTHOR
Antti Karttunen, Oct 08 2023
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 September 13 11:52 EDT 2024. Contains 375905 sequences. (Running on oeis4.)