Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003566
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003566 Least number m such that 10^m = +- 1 mod 10n + 1. +0
2
1, 6, 15, 5, 16, 30, 35, 9, 3, 2, 3, 11, 65, 46, 75, 33, 18, 90, 95, 33, 15, 48, 6, 15, 25, 28, 5, 14, 96, 42, 155, 53, 55, 30, 6, 171, 78, 42, 176, 100, 8, 70, 215, 42, 10, 230, 78, 6, 245, 166, 24, 26, 58, 270, 252, 16 (list; graph; listen)
OFFSET

0,2
CROSSREFS

Sequence in context: A019306 A115408 A105052 this_sequence A070870 A123623 A161397

Adjacent sequences: A003563 A003564 A003565 this_sequence A003567 A003568 A003569

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 December 9 14:43 EST 2009. Contains 170430 sequences.

AT&T Labs Research

Legal Notice
© 2009 AT&T Intellectual Property. All Rights Reserved.