A283593 Least m > 0 such that A283565(n) = Sum_{k=1..m} (A283565(n) mod k).

1, 2, 3, 5, 7, 6, 7, 7, 8, 9, 10, 8, 12, 11, 13, 15, 14, 15, 16, 20, 17, 20, 22, 25, 25, 25, 24, 24, 29, 28, 29, 31, 38, 36, 38, 38, 43, 41, 41, 46, 45, 47, 45, 48, 47, 47, 45, 47, 48, 48, 46, 49, 53, 51, 57, 58, 65, 55, 58, 65, 59, 57, 63, 60, 60, 63, 67, 68

Offset: 1

Author

Rémy Sigrist, Mar 11 2017

Keywords

• nonn

Examples

			A283565(4)=7 and (7 mod 1) + (7 mod 2) + (7 mod 3) + (7 mod 4) + (7 mod 5) = 0 + 1 + 1 + 3 + 2 = 7, hence a(4)=5.
		

Links

• Rémy Sigrist, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A283565.