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 A177860 #2 Mar 30 2012 19:00:09
%S A177860 1,1,4,8,540,12960,1797120,22619520,465813504,267346759680000,
%T A177860 216218419200000,199658024013127680000,136256285631578112000000,
%U A177860 12446179270879850496000000,34611344543529418987929600
%N A177860 Product of the quadratic residues of prime(n).
%C A177860 a(n) == (-1)^((p+1)/2) (mod p), if p = prime(n) is odd.
%D A177860 Carl-Erik Froeberg, On sums and products of quadratic residues, BIT, Nord. Tidskr. Inf.-behandl. 11 (1971) 389-398.
%H A177860 Rahul Gupta, <a href="http://www.cse.iitd.ernet.in/~sak/courses/ant/notes/ant.pdf">Algorithmic Number Theory, Section 24.5</a>
%F A177860 a(n) = (p-1)!/A177861(n), where p = prime(n).
%e A177860 The quadratic residues of prime(4) = 7 are 1, 2, and 4, so a(4) = 1*2*4 = 8.
%t A177860 Table[ Apply[Times, Flatten[Position[ Table[JacobiSymbol[i, Prime[n]], {i, 1, Prime[n] - 1}], 1]]], {n, 1, 16}]
%Y A177860 Cf. A076409 Sum of the quadratic residues of prime(n), A177861 Product of the quadratic nonresidues of prime(n), A163366 Product of the quadratic residues of prime(n) modulo prime(n).
%K A177860 easy,nonn
%O A177860 1,3
%A A177860 _Jonathan Sondow_, May 14 2010