login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A084681 Order of 10 modulo 9n [i.e. least m such that 10^m = 1 (mod 9n)] or 0 when no such number exists. 1
1, 0, 3, 0, 0, 0, 6, 0, 9, 0, 2, 0, 6, 0, 0, 0, 16, 0, 18, 0, 6, 0, 22, 0, 0, 0, 27, 0, 28, 0, 15, 0, 6, 0, 0, 0, 3, 0, 6, 0, 5, 0, 21, 0, 0, 0, 46, 0, 42, 0, 48, 0, 13, 0, 0, 0, 18, 0, 58, 0, 60, 0, 18, 0, 0, 0, 33, 0, 66, 0, 35, 0, 8, 0, 0, 0, 6, 0, 13, 0, 81, 0, 41, 0, 0, 0, 84, 0, 44, 0, 6, 0, 15, 0 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

LINKS

K. Matthews, Finding the order of a (mod m)

CROSSREFS

Sequence in context: A184762 A081805 A181189 * A096528 A161837 A160086

Adjacent sequences:  A084678 A084679 A084680 * A084682 A084683 A084684

KEYWORD

nonn

AUTHOR

Lekraj Beedassy (blekraj(AT)yahoo.com), Jun 30 2003

EXTENSIONS

More terms from John W. Layman (layman(AT)math.vt.edu), Oct 09 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 15:20 EST 2012. Contains 205823 sequences.