OFFSET
1,3
COMMENTS
Because 65537 is a Fermat prime, the complement of this set, A136806, is the set of primitive roots (mod 65537).
LINKS
Nathaniel Johnston, Table of n, a(n) for n = 1..32769 (full sequence)
OEIS Wiki, Index to sequences related to squares
FORMULA
a(n) + a(32771 - n) = 65537 for n > 1.
MAPLE
A136805:={}: for n from 0 to 65536 do A136805 := A136805 union {n^2 mod 65537}: od: l:=sort(convert(A136805, list)): l[1..63]; # Nathaniel Johnston, Jun 23 2011
MATHEMATICA
p = 65537; Select[Range[0, p - 1], JacobiSymbol[#, p] == 1 &]
PROG
(Sage) [quadratic_residues(65537)] # Zerinvary Lajos, May 24 2009
(PARI) A136805=Set([k^2 | k <- [0..2^16]]%65537); \\ M. F. Hasler, Nov 15 2017
(Scala) ((1: BigInt) to (65537: BigInt)).map(n => (n * n) % 65537).toSet.toSeq.sorted // Alonso del Arte, Dec 17 2019
CROSSREFS
KEYWORD
fini,full,easy,nonn
AUTHOR
T. D. Noe, Jan 22 2008
STATUS
approved