login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 1

%I #5 Mar 30 2012 17:38:03

%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,

%T 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,

%U 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

%N 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.

%C The zeros are only conjectures (cf. A074981).

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

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

%K nonn

%O 1,1

%A _Zak Seidov_, Oct 13 2002

%E More terms from _David Wasserman_, Jan 23 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 02:23 EDT 2024. Contains 371264 sequences. (Running on oeis4.)