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!)
A084389 Solutions n for n^3 + m = k^2. 0
2, 1, 1, 3, 13, 1, 2, 7, 5, 3, 1, 2, 19, 1, 4, 3, 11, 6, 2, 5, 1, 3, 9, 2, 4, 1, 8, 14, 152, 5, 2, 45, 1, 10, 2, 3, 18, 7, 1, 5, 95, 4, 15, 13, 6, 9, 2, 3, 53, 1, 12, 17, 16, 5, 4, 2, 31, 7, 3, 1, 6, 21, 105, 23, 10, 2, 33, 5, 1, 3, 9, 14, 6, 7, 2, 11, 4, 1, 84, 19, 3, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

Cino Hilliard, Proof that n^3+7 <> k^2 for all integers n,k.

PROG

(PARI) n3pmsq4(n, m1) = { for(m=1, m1, for(x=1, n, y=x^3+m; if(issquare(y), print1(x", "); break) ) ) }

CROSSREFS

Cf. sequences for n^3+7, n^3+17, n^3+3, n^3+2, n^3+5.

Sequence in context: A066013 A212261 A014521 * A122022 A134357 A049258

Adjacent sequences:  A084386 A084387 A084388 * A084390 A084391 A084392

KEYWORD

easy,nonn

AUTHOR

Cino Hilliard, Jun 23 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 August 11 09:55 EDT 2020. Contains 336423 sequences. (Running on oeis4.)