cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

Original entry on oeis.org

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

Views

Author

Zak Seidov, Oct 13 2002

Keywords

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