A345994 Let m = A344005(n) = smallest m such that n divides m*(m+1); a(n) = min(gcd(n,m), gcd(n,m+1)).

1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 2, 3, 1, 1, 2, 1, 4, 3, 2, 1, 3, 1, 2, 1, 4, 1, 5, 1, 1, 3, 2, 5, 4, 1, 2, 3, 5, 1, 6, 1, 4, 5, 2, 1, 3, 1, 2, 3, 4, 1, 2, 5, 7, 3, 2, 1, 4, 1, 2, 7, 1, 5, 6, 1, 4, 3, 5, 1, 8, 1, 2, 3, 4, 7, 6, 1, 5, 1, 2, 1, 4, 5, 2, 3, 8, 1, 9, 7, 4, 3, 2, 5

Offset: 1

Author

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

Keywords

• nonn

Comments

This is the minimum of A345992 and A345993.

Links

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

Crossrefs

Cf. A344005, A345992, A345993, A345995, A346956.

Cf. also A051119, A284600.