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!)
A345999 a(n) = (m+1)/gcd(m+1,n), where m = A344005(n). 3
2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 2, 1, 1, 1, 1, 4, 1, 3, 1, 1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 4, 1, 2, 2, 1, 1, 8, 3, 1, 1, 1, 1, 1, 5, 2, 1, 1, 1, 1, 1, 1, 1, 7, 1, 10, 3, 1, 1, 2, 6, 1, 1, 4, 11, 1, 1, 5, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
This is (A344005(n)+1)/A345993(n).
LINKS
CROSSREFS
Sequence in context: A307609 A043287 A212177 * A249622 A287656 A043286
KEYWORD
nonn
AUTHOR
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 14:03 EDT 2024. Contains 372409 sequences. (Running on oeis4.)