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 A023161 #12 Mar 30 2012 18:35:18 %S A023161 1,2,2,2,2,4,4,2,4,4,2,4,4,8,4,2,2,8,10,4,8,4,7,4,2,8,10,8,3,8,4,2,4, %T A023161 4,8,8,10,20,8,4,2,16,7,4,8,14,3,4,7,4,4,8,4,20,4,8,20,6,3,8,4,8,16,2, %U A023161 8,8,19,4,14,16,3,8,10,20,4,20,8,16,10,4,16,4,10,16,4,14,6,4,7,16,16,14,8,6,20 %N A023161 Number of cycles of function f(x) = x^10 mod n. %C A023161 Not multiplicative; the smallest counterexample is a(667). - _T. D. Noe_, Nov 14 2006 %H A023161 David W. Wilson, <a href="/A023161/b023161.txt">Table of n, a(n) for n=1..10000</a> %Y A023161 Cf. A023153 %Y A023161 Cf. A023153-A023160 (cycles of the functions f(x)=x^k mod n for k=2..9) %K A023161 nonn %O A023161 1,2 %A A023161 _David W. Wilson_