cp's OEIS Frontend

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.

A023155 Number of cycles of function f(x) = x^4 mod n.

Original entry on oeis.org

1, 2, 2, 2, 2, 4, 4, 2, 4, 4, 4, 4, 4, 8, 4, 2, 2, 8, 6, 4, 8, 8, 4, 4, 4, 8, 6, 8, 4, 8, 10, 2, 8, 4, 8, 8, 6, 12, 8, 4, 4, 16, 10, 8, 8, 8, 4, 4, 10, 8, 4, 8, 4, 12, 8, 8, 12, 8, 4, 8, 10, 20, 16, 2, 8, 16, 10, 4, 8, 16, 10, 8, 6, 12, 8, 12, 16, 16, 10, 4, 8, 8, 6, 16, 4, 20, 8, 8, 4, 16, 16, 8, 20, 8, 12
Offset: 1

Views

Author

Keywords

Comments

Not multiplicative; the smallest counterexample is a(275). - T. D. Noe, Nov 14 2006

Crossrefs

Cf. A023153-A023161 (cycles of the functions f(x)=x^k mod n for k=2..10)