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!)
A330692 a(n) = n / gcd(n, A309639(n)), where A309639(n) is the index of the least harmonic number H_i whose denominator (A002805) is divisible by n. 6
1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 2, 3, 1, 1, 2, 1, 4, 7, 2, 1, 8, 1, 2, 1, 4, 1, 6, 1, 1, 3, 2, 5, 4, 1, 2, 3, 5, 1, 14, 1, 4, 5, 2, 1, 3, 1, 2, 3, 4, 1, 2, 5, 7, 3, 2, 1, 12, 1, 2, 7, 1, 5, 6, 1, 4, 23, 10, 1, 8, 1, 2, 3, 4, 7, 6, 1, 5, 1, 2, 1, 28, 5, 2, 3, 8, 1, 10, 7, 4, 3, 2, 5, 3, 1, 2, 9, 4, 1, 6, 1, 8, 35 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
LINKS
FORMULA
a(n) = n/A330691(n) = n / gcd(n, A309639(n)).
PROG
(PARI) A330692(n) = (n/gcd(n, A309639(n)));
CROSSREFS
Cf. A000961 (indices of 1's).
Sequence in context: A052128 A284600 A114536 * A349658 A345992 A350333
KEYWORD
nonn
AUTHOR
Antti Karttunen, Dec 29 2019
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 11 11:39 EDT 2024. Contains 372409 sequences. (Running on oeis4.)