OFFSET
1,2
COMMENTS
A123489 is a signed version. - Michael Somos, Aug 27 2012
REFERENCES
A. J. C. Cunningham, Quadratic Partitions. Hodgson, London, 1904, p. 1.
B. Engquist and Wilfried Schmid, Mathematics Unlimited - 2001 and Beyond, Chapter on Error-correcting codes and curves over finite fields, see pp. 1118-1119. [From Neven Juric, Oct 16 2008.]
D. H. Lehmer, Guide to Tables in the Theory of Numbers. Bulletin No. 105, National Research Council, Washington, DC, 1941, p. 55.
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
Ruperto Corso, Table of n, a(n) for n = 1..1000
A. J. C. Cunningham, Quadratic Partitions, Hodgson, London, 1904 [Annotated scans of selected pages]
S. R. Finch, Powers of Euler's q-Series, (arXiv:math.NT/0701251).
MATHEMATICA
Reap[For[p = 2, p<2000, p = NextPrime[p], For[x = 1, x <= Floor[2Sqrt[p]], x++, px = 4p - x^2; If[Mod[px, 27] == 0, If[IntegerQ[Sqrt[px/27]], Sow[x] ]]]]][[2, 1]] (* Jean-François Alcover, Sep 06 2018, after Ruperto Corso *)
PROG
(PARI) forprime(p=2, 10000, for(x=1, floor(2*sqrt(p)), px=4*p-x^2; if(px%27==0, if(issquare(px/27, &y), print1(x", "))))) /* Ruperto Corso, Dec 14 2011 */
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
Corrected and extended by Ruperto Corso, Dec 14 2011
STATUS
approved