login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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}. 2
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

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

LINKS

Rémy Sigrist, Table of n, a(n) for n = 1..767

Rémy Sigrist, PARI program for A117988

PROG

(PARI) See Links section.

CROSSREFS

Cf. A023153, A117986, A119787.

Sequence in context: A186201 A138624 A071428 * A263636 A238411 A304909

Adjacent sequences:  A117985 A117986 A117987 * A117989 A117990 A117991

KEYWORD

nonn,changed

AUTHOR

John W. Layman, Apr 14 2006

EXTENSIONS

More terms from Rémy Sigrist, Sep 20 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 21 09:15 EDT 2019. Contains 327253 sequences. (Running on oeis4.)