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!)
A002938 The minimal sequence (from solving n^3 - m^2 = a(n)).
(Formerly M0033 N0008)
4
0, 1, 2, 0, 4, 9, 18, 17, 0, 24, 35, 36, 12, 40, 11, 0, 13, 56, 30, 79, 45, 39, 67, 100, 0, 113, 83, 48, 53, 104, 138, 7, 163, 100, 26, 0, 28, 116, 217, 9, 248, 104, 17, 80, 79, 8, 139, 297, 0, 316, 155, 17, 119, 145, 89, 55, 293, 252, 170, 225, 405, 184, 47, 0, 49 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

a(n^2)=0 - Benoit Cloitre, Aug 17 2002

REFERENCES

Marshall Hall, Jr., The Diophantine equation x^3-y^2=k, pp. 173-198 of A. O. L. Atkin and B. J. Birch, editors, Computers in Number Theory. Academic Press, NY, 1971.

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

T. D. Noe, Table of n, a(n) for n = 1..10000

FORMULA

a(n) = |A077119(n+1)|.

MATHEMATICA

f1[n_]:=n-Floor[Sqrt[n]]^2; f2[n_]:=Ceiling[Sqrt[n]]^2-n; Table[Min[f1[n^3], f2[n^3]], {n, 100}] (* Vladimir Joseph Stephan Orlovsky, Apr 08 2010 *)

PROG

(PARI) a(n)=vecmin(vector(ceil(n^(3/2)), i, abs(n^3-i^2)))

CROSSREFS

Sequence in context: A021492 A287314 A077119 * A111938 A224822 A246928

Adjacent sequences:  A002935 A002936 A002937 * A002939 A002940 A002941

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

EXTENSIONS

More terms from Benoit Cloitre, Aug 17 2002

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 17 17:59 EST 2020. Contains 331999 sequences. (Running on oeis4.)