Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #26 Aug 30 2021 01:54:15
%S 3,1,1,1,1,4,5,1,2,2,1,8,1,1,1,4,1,1,1,2,1,1,1,1,4,3,1,1,1,1,2,1,1,1,
%T 1,1,1,1,3,2,3,4,2,1,1,6,1,1,4,1,1,4,1,1,1,1,1,1,6
%N For the n-th number k = A318932(n) such that the Diophantine equation y^2 - k = x^3 has a solution, a(n) gives the number of solutions.
%C Hemer gives a(n) for all values of k <= 100.
%H Hugo Pfoertner, <a href="/A318933/b318933.txt">Table of n, a(n) for n = 1..1000</a>
%H Joerg Arndt, <a href="/A318933/a318933.txt">Table of A318932(n) A318933(n)</a>, from Hemer's paper.
%H Ove Hemer, <a href="https://doi.org/10.1007/BF02589282">Notes on the diophantine equation y^2 - k = x^3</a>, Arkiv för Matematik 3.1 (1954): 67-77.
%Y Cf. A318932.
%K nonn
%O 1,1
%A _N. J. A. Sloane_, Sep 12 2018
%E Terms up to a(59) from Hemer's paper added by _Joerg Arndt_, Aug 28 2021