login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060467 Consider solutions to n = x^3 + y^3 + z^3 (for n not 4 or 5 mod 9) with 0 <= |x| <= |y| <= |z|; take solution with smallest |z| and smallest |y|; sequence give value of z. 3
0, 1, 1, 1, 2, 2, 2, 2, 2, 3, -11, 2, 1626, 2, 3, 3, 3, 16, 2, 3, 3, 3, 3, 3 (list; graph; refs; listen; history; internal format)
OFFSET

0,5

COMMENTS

Indexed by A060464.

REFERENCES

R. K. Guy, Unsolved Problems in Number Theory, Section D5.

LINKS

H. Mishima, About n=x^3+y^3+z^3

EXAMPLE

For n=16 the smallest solution is 16 = (-511)^3 + (-1609)^3 + 1626^3, which gives the term 1626.

CROSSREFS

Cf. A060465-A060466.

Sequence in context: A079629 A029116 A064770 * A125918 A083533 A076500

Adjacent sequences:  A060464 A060465 A060466 * A060468 A060469 A060470

KEYWORD

sign,nice,hard

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Apr 10 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 08:58 EST 2012. Contains 205901 sequences.