Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A089587
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A089587 a(n) is the smallest integer k, 0<k<n, that most often satisfies the condition: k^m > k^(m+1) (modulo n) as m varies from 1 to n-1, for n>2, with a(1)=0 and a(2)=1. +0
2
0, 1, 2, 3, 2, 5, 4, 3, 7, 8, 3, 5, 9, 4, 8, 11, 2, 13, 11, 3, 16, 5, 6, 5, 21, 9, 19, 18, 16, 8, 16, 23, 9, 6, 16, 31, 26, 11, 20, 23, 16, 11, 36, 27, 34, 12, 6, 29, 43, 41, 26, 35, 16, 37, 43, 25, 49, 49, 3, 53, 47, 16, 32, 57, 38, 4, 37, 39, 12, 16, 57, 61, 37, 26, 61, 49, 67, 47, 55 (list; graph; listen)
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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research