Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A055693
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A055693 10^n (mod n-1) = -1. +0
1
2, 102, 41310, 102690, 309162, 315150, 1000002, 2488530, 4564350, 10637055, 28855610, 35049930, 38982870, 42176490, 43232070, 53288510, 64253070 (list; graph; listen)
OFFSET

1,1

MATHEMATICA

Do[If[PowerMod[10, n, n-1]==n-2, Print[n]], {n, 2, 10^8}]

CROSSREFS

Adjacent sequences: A055690 A055691 A055692 this_sequence A055694 A055695 A055696

Sequence in context: A028989 A113575 A111012 this_sequence A106299 A101530 A001184

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 09 2000

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 May 11 10:28 EDT 2008. Contains 139662 sequences.


AT&T Labs Research