Greetings from
The On-Line Encyclopedia of Integer Sequences
!
Hints
Search:
id:A003559
Displaying 1-1 of 1 results found.
page 1
Format:
long
| short |
internal
|
text
Sort: relevance |
references
|
number
Highlight: on |
off
A003559
Least number m such that 3^m = +- 1 mod 3n + 1.
+0
1
1, 3, 2, 3, 4, 9, 5, 10, 3, 15, 8, 9, 4, 21, 11, 21, 6, 20, 14, 5, 16, 11, 12, 6, 9, 39, 4, 16, 10, 6, 23, 24, 20, 17, 26, 27, 12, 44, 29, 5, 15, 63, 12, 9, 16, 69, 35, 14, 9, 25, 30, 39, 8, 81, 41, 39, 21, 60, 44, 45
(
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 November 29 12:46 EST 2009. Contains 167659 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
