Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003567
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003567 Least number m such that 11^m = +- 1 mod 11n + 1. +0
1
1, 11, 8, 6, 6, 33, 12, 11, 10, 3, 2, 3, 12, 30, 41, 29, 23, 11, 6, 48, 28, 81, 63, 26, 11, 120, 74, 51, 16, 165, 6, 44, 12, 50, 32, 99, 16, 209, 7, 42, 56, 231, 78, 48, 60, 156, 6, 253, 18, 84, 140, 19, 72, 48, 100, 154 (list; graph; listen)
OFFSET

0,2

CROSSREFS

Sequence in context: A159526 A090841 A085757 this_sequence A085688 A164059 A068974

Adjacent sequences: A003564 A003565 A003566 this_sequence A003568 A003569 A003570

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 13:47 EST 2009. Contains 167481 sequences.


AT&T Labs Research