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.

A117988 Number of functions f:[n]->[n] such that f[(x^2) mod n]=[f(x)^2] mod n for all x in [n], for n=1,2,3,... Here [n] denotes {0,1,2,...,n-1}.

Original entry on oeis.org

1, 4, 6, 16, 18, 576, 78, 1728, 1365, 5184, 486, 2985984, 3474, 389376, 13583700, 268435456, 65538, 119246400, 45006, 39261044736, 21400013700, 15116544, 67590, 45476068117708800, 8696104065, 772395264, 19496328075, 1822309056774144, 231340050
Offset: 1

Views

Author

John W. Layman, Apr 14 2006

Keywords

Comments

See A117986 and A117987 for results on other modular functional equations.

Crossrefs

Programs

  • PARI
    \\ See Links section.

Extensions

More terms from Rémy Sigrist, Sep 20 2019