Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A117987
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A117987 Number of functions f:[n]->[n] such that f[(2*x) mod n]=[2*f(x)] mod n for all x in [n], for n=1,2,3,... Here [n] denotes {0,1,2,...,n-1}. +0
3
1, 2, 3, 8, 5, 24, 49, 128 (list; graph; listen)
OFFSET

1,2

COMMENT

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

CROSSREFS

Cf. A117986, A117988.

Sequence in context: A062956 A053650 A119794 this_sequence A091136 A140651 A007955

Adjacent sequences: A117984 A117985 A117986 this_sequence A117988 A117989 A117990

KEYWORD

nonn

AUTHOR

John W. Layman (layman(AT)math.vt.edu), Apr 11 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research