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