Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003570
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003570 a(n) = least positive number m such that 8^m == +1 or -1 mod 2n + 1, with a(0) = 0 by convention. +0
1
0, 1, 2, 1, 1, 5, 2, 4, 4, 3, 2, 11, 10, 3, 14, 5, 5, 4, 6, 4, 10, 7, 4, 23, 7, 8, 26, 20, 3, 29, 10, 2, 2, 11, 22, 35, 3, 20, 10, 13, 9, 41, 8, 28, 11, 4, 10, 12, 8, 5, 50, 17, 4, 53, 6, 12, 14, 44, 4, 8, 55, 20, 50, 7, 7, 65, 6, 12, 34, 23, 46, 20, 14, 14, 74, 5, 8, 20, 26, 52, 11, 27, 20, 83 (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 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research