Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003565
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003565 Least number m such that 9^m = +- 1 mod 9n + 1. +0
1
1, 9, 3, 9, 11, 10, 8, 3, 2, 3, 10, 27, 29, 63, 8, 7, 15, 81, 21, 45, 18, 99, 6, 15, 28, 46, 5, 55, 65, 15, 6, 68, 37, 17, 39, 30, 83, 147, 20, 171, 18, 189, 24, 99, 42, 82, 26, 27, 24, 20, 22, 33, 119, 243, 30, 25, 64, 29 (list; graph; listen)
OFFSET

0,2
CROSSREFS

Adjacent sequences: A003562 A003563 A003564 this_sequence A003566 A003567 A003568

Sequence in context: A111971 A086705 A019879 this_sequence A103935 A040077 A038293

KEYWORD

nonn

AUTHOR

njas

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 January 7 17:16 EST 2009. Contains 152824 sequences.

AT&T Labs Research

Legal Notice
© 2007 AT&T Knowledge Ventures. All Rights Reserved.