login
The OEIS is supported by the many generous donors 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}. 3

%I #8 Sep 21 2019 08:27:12

%S 1,4,6,16,18,576,78,1728,1365,5184,486,2985984,3474,389376,13583700,

%T 268435456,65538,119246400,45006,39261044736,21400013700,15116544,

%U 67590,45476068117708800,8696104065,772395264,19496328075,1822309056774144,231340050

%N 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}.

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

%H Rémy Sigrist, <a href="/A117988/b117988.txt">Table of n, a(n) for n = 1..767</a>

%H Rémy Sigrist, <a href="/A117988/a117988.gp.txt">PARI program for A117988</a>

%o (PARI) See Links section.

%Y Cf. A023153, A117986, A119787.

%K nonn

%O 1,2

%A _John W. Layman_, Apr 14 2006

%E More terms from _Rémy Sigrist_, Sep 20 2019

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 02:53 EDT 2024. Contains 371906 sequences. (Running on oeis4.)