This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A136805 #22 Dec 28 2019 14:33:29
%S A136805 0,1,2,4,8,9,13,15,16,17,18,19,21,25,26,30,32,33,34,35,36,37,38,42,49,
%T A136805 50,52,53,55,60,64,66,68,69,70,71,72,74,76,77,79,81,84,87,93,97,98,
%U A136805 100,103,104,106,107,109,110,115,117,120,121,123,128,129,132,135
%N A136805 Squares mod 65537.
%C A136805 Because 65537 is a Fermat prime, the complement of this set, A136806, is the set of primitive roots (mod 65537).
%H A136805 Nathaniel Johnston, <a href="/A136805/b136805.txt">Table of n, a(n) for n = 1..32769</a> (full sequence)
%H A136805 OEIS Wiki, <a href="/index/Sq#squares">Index to sequences related to squares</a>
%F A136805 a(n) + a(32771 - n) = 65537 for n > 1.
%p A136805 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
%t A136805 p = 65537; Select[Range[0, p - 1], JacobiSymbol[#, p] == 1 &]
%o A136805 (Sage) [quadratic_residues(65537)] # _Zerinvary Lajos_, May 24 2009
%o A136805 (PARI) A136805=Set([k^2 | k <- [0..2^16]]%65537); \\ _M. F. Hasler_, Nov 15 2017
%o A136805 (Scala) ((1: BigInt) to (65537: BigInt)).map(n => (n * n) % 65537).toSet.toSeq.sorted // _Alonso del Arte_, Dec 17 2019
%Y A136805 Cf. A136806 (nonsquares mod 65537); A136803 and A136804 ((non)squares mod 257).
%Y A136805 Cf. A010379.
%K A136805 fini,full,easy,nonn
%O A136805 1,3
%A A136805 _T. D. Noe_, Jan 22 2008