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