Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A055692
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A055692 9^n (mod n-1) = -1. +0
1
2, 3, 11, 42, 147, 13818, 21450, 27594, 41370, 55011, 126291, 265722, 417123, 1315635, 3994571, 5704611, 6860490, 9298842, 13941354, 14349027, 17658578, 20382810, 26557874, 27841338, 69831363, 86550090 (list; graph; listen)
OFFSET

1,1

MATHEMATICA

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

CROSSREFS

Adjacent sequences: A055689 A055690 A055691 this_sequence A055693 A055694 A055695

Sequence in context: A000280 A046224 A081173 this_sequence A051075 A051087 A051081

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 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research