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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A085333 a(n) is the least n-th power of a prime that are sum of two positive cubes, or 0 if no solution exists (for n=3k). 1
2, 9, 0, 16, 243, 0, 128, 6561, 0, 1024, 177147, 0, 8192, 4782969, 0, 65536, 129140163, 0, 524288, 3486784401, 0, 4194304, 94143178827, 0, 33554432, 2541865828329, 0, 268435456, 68630377364883, 0, 2147483648, 1853020188851841, 0 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

FORMULA

a(n) is the least solution to p^n=x^3+y^3, x, y>0 or a(n)=a(3k)=0 labels cases if no solution exists.

a(3k)=0, a(3k+1)=2^(3k+1), a(3k+2)=3^(3k+2).

CROSSREFS

Cf. A085332.

Sequence in context: A188619 A020817 A133768 * A128892 A187556 A198103

Adjacent sequences:  A085330 A085331 A085332 * A085334 A085335 A085336

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jul 07 2003

EXTENSIONS

Formula, corrected description and more terms from Ray Chandler (rayjchandler(AT)sbcglobal.net), Jul 20 2003

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 15 10:28 EST 2012. Contains 205763 sequences.