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 A222009 #8 Feb 12 2013 17:19:49
%S A222009 1,2,61,71,684847,8621,4768743913,192769238731,31302497,3624013907027,
%T A222009 3389284413733950439,20347152500093,73535243111830065216714893617,
%U A222009 579021662547635771462791245283,38283945111344558723552263341142779661,60296900399609972459,271233083114844569997128597,1382959355737627871079165208413804169
%N A222009 (Product(primitive roots of p) - 1)/p, where p = prime(n) and n > 2.
%C A222009 Gauss proved that the product of the primitive roots of p is congruent to 1 modulo p, for all primes p except p = 3.
%D A222009 C. F. Gauss, Disquisitiones Arithmeticae, Yale, 1965; see p. 52.
%H A222009 Wikipedia, <a href="http://en.wikipedia.org/wiki/Primitive_root_modulo_n#Arithmetic_facts">Primitive root</a>
%F A222009 a(n) = (A123475(n) - 1)/A000040(n) for n > 2.
%e A222009 The primitive roots of prime(4) = 7 are 3 and 5, and (3*5 - 1)/7 = 14/7 = 2, so a(4) = 2.
%t A222009 a[n_] := With[{p = Prime[n]}, Select[Range[p - 1], MultiplicativeOrder[#, p] == p - 1 &]]; Table[(Product[ a[n][[i]], {i, Length[a[n]]}] - 1)/Prime[n], {n, 3, 20}]
%Y A222009 Cf. A060749, A088145, A123475.
%K A222009 nonn
%O A222009 3,2
%A A222009 _Jonathan Sondow_, Feb 09 2013