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 A023160 #12 Mar 30 2012 18:35:18 %S A023160 1,2,3,3,5,6,3,5,3,10,7,9,5,6,15,9,13,6,3,15,9,14,7,15,13,10,3,9,13, %T A023160 30,7,17,21,26,15,9,5,6,15,25,25,18,7,21,15,14,7,27,7,26,39,15,21,6, %U A023160 35,15,9,26,7,45,13,14,9,25,25,42,7,39,21,30,19,15,9,10,39,9,21,30,11,45,3,50,23 %N A023160 Number of cycles of function f(x) = x^9 mod n. %C A023160 Not multiplicative; the smallest counterexample is a(187). - _T. D. Noe_, Nov 14 2006 %H A023160 David W. Wilson, <a href="/A023160/b023160.txt">Table of n, a(n) for n=1..10000</a> %Y A023160 Cf. A023153 %Y A023160 Cf. A023153-A023161 (cycles of the functions f(x)=x^k mod n for k=2..10) %K A023160 nonn %O A023160 1,2 %A A023160 _David W. Wilson_