A165494 Iterations of k -> k+tau(k) from 2(2n-1)^2 until result not divisible by 4.

2, 3, 3, 3, 2, 3, 7, 2, 3, 6, 2, 9, 3, 2, 10, 3, 2, 2, 5, 7, 3, 4, 7, 10, 5, 5, 10, 8, 2, 7, 3, 8, 7, 4, 9, 36, 13, 9, 2, 6, 7, 5, 2, 2, 9, 4, 30, 2, 16, 4, 6, 6, 4, 11, 24, 16, 11, 9, 3, 11, 15, 2, 9, 10, 2, 26, 2, 10, 3, 3, 4, 13, 11, 5, 12, 3, 7, 17, 21, 17, 17, 12, 5, 4, 3, 8, 19, 9, 2

Offset: 1

Author

Hugo van der Sanden, Sep 21 2009

Keywords

• easy
• nonn

Comments

This sequence and A165495 explore a critical aspect of the behavior of A064491.

Examples

			For a(2) we start at 2.3^2=18; 18+tau(18)=24; 24+tau(24)=32; 32+tau(32)=38, which is not divisible by 4, so a(2)=3 for the 3 iterations needed.
		

Crossrefs

Cf. A064491, A165495