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 A211453 #3 Apr 11 2012 20:07:56
%S A211453 0,1,1,6,1,3,2,3,2,1,6,3,2,3,2,1,1,3,3,2,24,6,1,8,6,1,6,1,9,4,18,1,2,
%T A211453 3,1,30,3,3,2,1,1,3,2,6,1,6,3,6,1,3,8,2,30,5,16,2,1,6,3,4,3,1,9,2,6,1,
%U A211453 33,48,1,3,4,2,6,3,3,2,1,9,2,6,1,3,10,18
%N A211453 (p-1)/x, where p = prime(n) and x = ord(8,p), the smallest positive integer such that 8^x == 1 mod p.
%H A211453 T. D. Noe, <a href="/A211453/b211453.txt">Table of n, a(n) for n = 1..1000</a>
%t A211453 nn = 8; Table[If[Mod[nn, p] == 0, 0, (p-1)/MultiplicativeOrder[nn, p]], {p, Prime[Range[100]]}]
%Y A211453 Cf. A001917, A094593, A211449, A211450, A211451, A211452, A211454, A006556.
%K A211453 nonn
%O A211453 1,4
%A A211453 _T. D. Noe_, Apr 11 2012