Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A055691
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A055691 8^n (mod n-1) = -1. +0
1
2, 6, 14, 66, 186, 378, 546, 1190, 1470, 2406, 4470, 5250, 7086, 18578, 20166, 25806, 42602, 58590, 69006, 85566, 134946, 137346, 170586, 187838, 206646, 262146, 272610, 285390, 289394, 420210, 500570, 538734, 592410, 595686, 602250, 618450 (list; graph; listen)
OFFSET

1,1

MATHEMATICA

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

CROSSREFS

Adjacent sequences: A055688 A055689 A055690 this_sequence A055692 A055693 A055694

Sequence in context: A122109 A133155 A011455 this_sequence A072171 A131518 A130642

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