A075790 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 s.

2, 5, 1, 2, 2, 0, 1, 1, 4, 3, 4, 2, 6, 0, 1, 3, 2, 3, 2, 4, 2, 3, 2, 1, 10, 1, 3, 2, 14, 19, 1, 2, 4, 0, 1, 8, 3, 11, 5, 3, 2, 0, 21, 9, 2, 3, 9, 1, 2, 0, 7, 12, 26, 3, 3, 2, 8, 0, 29, 2, 8, 0, 1, 6, 4, 0, 33, 2, 10, 0, 5, 3, 2, 13, 5, 7, 2, 0, 7, 1, 12, 0, 41, 4, 6, 0, 13, 9, 2, 0, 3, 2, 2, 3, 7, 2, 2, 3

Offset

1,1

Comments

The zeros are only conjectures (cf. A074981).

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

Links

Table of n, a(n) for n=1..98.

Example

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

Crossrefs

Sequence in context: A197814 A091772 A275479 * A240543 A004575 A021402

Adjacent sequences: A075787 A075788 A075789 * A075791 A075792 A075793

Keyword

nonn

Author

Zak Seidov, Oct 13 2002

Extensions

More terms from David Wasserman, Jan 23 2005

Status

approved