login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A190580 Value of y in the Diophantine equation x^3 + y^3 = n*z^3 (with x>0 and minimal and x >= y and y != 0) 3
1, 17, -1, 1, 19, 2, 397, -1, -2, 1, 17299, -1, 1, 107, -65, 523, -359, 2, -3, -71, 1, -2, -11267, 62641, -1819, -14653, -4, 7, -1, 1, 1208, -472663, -10441, 17, -126, -11951, 53, -4, 323, -2404889, 5, -907929611, 36, -431, 3, -3547, -15616184186396177, -5, -3, -349, 3527, -140131, 17, -71, -901, -2741617, -2, 10183412861, -1, 1, -6, 33728183 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

A190356(n)^3 + a(n)^3 = A020898(n)*z^3. Unknown z corresponds to sequence A190581.

The 4 sequences A020898 [i.e. n], A190356 [i.e. x], A190580 [i.e. y] and A190581 [i.e. z] satisfy the equation A190356^3 + A190580^3 = A020898 * A190581^3

LINKS

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

Steven R. Finch, On a Generalized Fermat-Wiles Equation [broken link]

Steven R. Finch, On a Generalized Fermat-Wiles Equation [From the Wayback Machine]

Hisanori Mishima, Solutions of Diophantine equation x^3+y^3=A.z^3 ...

EXAMPLE

a(18) = 2  because  A020898(18) = 35 and 3^3 + 2^3 = 35*1^3.

MATHEMATICA

Table[ y /. First[ Solve[ A190356[[n]]^3 + y^3 == A020898[[n]] * A190581[[n]]^3 ] ], {n, 62}] (* Jean-François Alcover, Jan 04 2012 *)

CROSSREFS

Cf. A020898 and A190356.

Sequence in context: A040290 A201134 A040289 * A176203 A103637 A229956

Adjacent sequences:  A190577 A190578 A190579 * A190581 A190582 A190583

KEYWORD

sign

AUTHOR

Jean-François Alcover, May 13 2011

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 20 22:47 EST 2020. Contains 332086 sequences. (Running on oeis4.)