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!)
A085333 a(n) is the least n-th power of a prime that is the 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; text; internal format)
OFFSET

1,1

LINKS

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

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).

From Chai Wah Wu, May 18 2017: (Start)

a(n) = 35*a(n-3) - 216*a(n-6) for n > 6.

G.f.: x*(-72*x^4 - 54*x^3 + 9*x + 2)/(216*x^6 - 35*x^3 + 1). (End)

CROSSREFS

Cf. A085332.

Sequence in context: A020817 A245217 A133768 * A248853 A272003 A128892

Adjacent sequences:  A085330 A085331 A085332 * A085334 A085335 A085336

KEYWORD

nonn

AUTHOR

Labos Elemer, Jul 07 2003

EXTENSIONS

Formula, corrected description and more terms from Ray Chandler, Jul 20 2003

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 May 7 02:20 EDT 2021. Contains 343636 sequences. (Running on oeis4.)