login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A075788
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 r.
2
3, 3, 2, 2, 3, 0, 4, 4, 5, 13, 3, 4, 7, 0, 8, 5, 5, 3, 3, 6, 5, 7, 3, 2, 5, 35, 6, 2, 15, 83, 16, 6, 7, 0, 18, 10, 8, 37, 8, 7, 7, 0, 22, 5, 7, 17, 2, 8, 9, 0, 10, 14, 27, 9, 8, 8, 11, 0, 30, 8, 5, 0, 12, 10, 9, 0, 34, 10, 13, 0, 14, 9, 9, 3, 10, 5, 9, 0, 2, 12, 15, 0, 42, 10, 11, 0, 16, 13, 11, 0, 10
OFFSET
1,1
COMMENTS
The zeros are only conjectures (cf. A074981).
Use 4^2 rather than 2^4, etc.
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: A366424 A374409 A021305 * A362503 A324080 A303934
KEYWORD
nonn
AUTHOR
Zak Seidov, Oct 13 2002
EXTENSIONS
More terms from David Wasserman, Jan 23 2005
STATUS
approved