A075791 If n can be written in the form r^i-s^j (see A074981), where r,s,i,j are integers with r>0, s>0, i>1, j>1 choose the representation with smallest r^i (in case of ties, minimize i and j); or if n is not of this form set r=s=i=j=0; sequence gives values of j.

3, 2, 2, 2, 2, 0, 2, 2, 2, 7, 2, 2, 2, 0, 2, 2, 3, 2, 3, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 0, 2, 2, 3, 3, 2, 2, 3, 0, 2, 2, 2, 5, 2, 2, 5, 0, 2, 2, 2, 3, 2, 3, 2, 0, 2, 2, 2, 0, 2, 2, 2, 0, 2, 5, 2, 0, 3, 2, 3, 2, 2, 2, 2, 0, 2, 2, 2, 0, 2, 2, 2, 0, 2, 2, 5, 0, 2, 3, 5, 3, 2, 2, 7, 3, 2, 2, 3, 0, 2, 2, 2

Offset: 1

Author

Zak Seidov, Oct 13 2002

Keywords

• nonn

Comments

The zeros are only conjectures (cf. A074981).

Use 4^2 rather than 2^4, etc.

Examples

			1 = 3^2 - 2^3, 2 = 3^3 - 5^2, 3 = 2^2 - 1^2, 4 = 2^3 - 2^2, etc.
		

Extensions

More terms from David Wasserman, Jan 23 2005