%I #4 Mar 30 2012 17:22:23
%S 3,4,6,7,12,7,18,25,24,30,34,25,42,34,48,54,60,61,61,72,79,61,84,90,
%T 115,102,115,108,106,114,106,132,138,115,150,169,142,187,168,174,180,
%U 187,192,169,198,187,223,250,228,250,234,240,223,252,258,264,270,241,250
%N For p=prime(n), a(n) = number of points (x,y) on the elliptic curve x^3 + y^3 = 1 (mod p), including the point at infinity.
%C Note that the number of points is p+1 when p+1=0 (mod 3); p is a prime in A003627.
%e a(2) = 4 because over GF(3) the points on the curve are (0,1), (1,0), (2,2) and the point at infinity.
%t Table[p=Prime[n]; s2=Mod[Table[y^3, {y, 0, p-1}], p]; s3=Mod[Table[1-x^3, {x, 0, p-1}], p]; s=Intersection[Union[s2], Union[s3]]; 1+Sum[Count[s2, s[[i]]]*Count[s3, s[[i]]], {i, Length[s]}], {n, 100}] (T. D. Noe)
%Y Cf. A098514 (number of points on the elliptic curve y^2 = x^3 + x + 1 (mod prime(n))).
%K nonn
%O 0,1
%A Ahmed Fares (ahmedfares(AT)my-deja.com), May 09 2001
%E Edited and extended by _T. D. Noe_, Sep 14 2004