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