A345999 a(n) = (m+1)/gcd(m+1,n), where m = A344005(n).

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

Offset: 1

Author

Robert Dougherty-Bliss and N. J. A. Sloane, Jul 18 2021

Keywords

• nonn

Comments

This is (A344005(n)+1)/A345993(n).

Links

• N. J. A. Sloane, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A344005, A345992-A345998.