Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A109746
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A109746 Number of unique sequences of the type m^k mod n for n fixed, k>=1. +0
1
1, 2, 3, 4, 2, 6, 4, 7, 4, 10, 3, 12, 6 (list; graph; listen)
OFFSET

2,2

COMMENT

It appears that a(p)= p-1 (for prime p) and a(2p) = p-1 (for odd prime p), but this is only speculation. I (or someone else) need to calculate more values of a(n) to settle this conjecture.

EXAMPLE

E.g.: m mod 4 = {0,1,2,3,0,1,2,3,...}; m^2 mod 4 = {0,1,0,1,...}; m^3 mod 4= {0,1,0,3,0,1,0,3,...}; but m^4 mod 4 = {0,1,0,1} = m^2 mod 4; so for higher powers of m these sequences cycle, and are not unique, thus for mod 4 we have {0,1,2,3}, {0,1}, and {0,1,0,3} as unique and a(4) = 3

CROSSREFS

Sequence in context: A120636 A117744 A091732 this_sequence A061020 A047994 A117009

Adjacent sequences: A109743 A109744 A109745 this_sequence A109747 A109748 A109749

KEYWORD

nonn

AUTHOR

Bruce Corrigan (scentman(AT)myfamily.com), Aug 10 2005

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 July 23 17:35 EDT 2008. Contains 142285 sequences.


AT&T Labs Research