cp's OEIS Frontend

A002938 The minimal sequence from solving n^3 - m^2 = a(n).

%I A002938 M0033 N0008 #38 Oct 21 2023 06:34:41
%S A002938 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,
%T A002938 113,83,48,53,104,138,7,163,100,26,0,28,116,217,9,248,104,17,80,79,8,
%U A002938 139,297,0,316,155,17,119,145,89,55,293,252,170,225,405,184,47,0,49
%N A002938 The minimal sequence from solving n^3 - m^2 = a(n).
%D A002938 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.
%D A002938 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A002938 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A002938 T. D. Noe, <a href="/A002938/b002938.txt">Table of n, a(n) for n = 1..10000</a>
%F A002938 a(n) = |A077119(n+1)|.
%F A002938 a(n^2) = 0. - _Benoit Cloitre_, Aug 17 2002
%t A002938 f1[n_] := n - Floor[Sqrt[n]]^2;
%t A002938 f2[n_] := Ceiling[Sqrt[n]]^2-n;
%t A002938 Table[Min[f1[n^3], f2[n^3]], {n,100}] (* _Vladimir Joseph Stephan Orlovsky_, Apr 08 2010 *)
%o A002938 (PARI) a(n)=vecmin(vector(ceil(n^(3/2)),i,abs(n^3-i^2)))
%Y A002938 Cf. A077119.
%K A002938 nonn
%O A002938 1,3
%A A002938 _N. J. A. Sloane_
%E A002938 More terms from _Benoit Cloitre_, Aug 17 2002