Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A023160
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A023160 Number of cycles of function f(x) = x^9 mod n. +0
2
1, 2, 3, 3, 5, 6, 3, 5, 3, 10, 7, 9, 5, 6, 15, 9, 13, 6, 3, 15, 9, 14, 7, 15, 13, 10, 3, 9, 13, 30, 7, 17, 21, 26, 15, 9, 5, 6, 15, 25, 25, 18, 7, 21, 15, 14, 7, 27, 7, 26, 39, 15, 21, 6, 35, 15, 9, 26, 7, 45, 13, 14, 9, 25, 25, 42, 7, 39, 21, 30, 19, 15, 9, 10, 39, 9, 21, 30, 11, 45, 3, 50, 23 (list; graph; listen)
OFFSET

1,2

COMMENT

Not multiplicative; the smallest counterexample is a(187). - T. D. Noe (noe(AT)sspectra.com), Nov 14 2006

LINKS

David W. Wilson, Table of n, a(n) for n=1..10000

CROSSREFS

Cf. A023153

Cf. A023153-A023161 (cycles of the functions f(x)=x^k mod n for k=2..10)

Sequence in context: A106530 A050976 A053447 this_sequence A085312 A046530 A003558

Adjacent sequences: A023157 A023158 A023159 this_sequence A023161 A023162 A023163

KEYWORD

nonn

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research