Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A055685
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A055685 Numbers n such that 2^n (mod n-1) == -1. +0
2
2, 6, 66, 378, 1190, 1470, 25806, 58590, 134946, 137346, 170586, 272610, 285390, 420210, 538734, 592410, 618450, 680706, 778806, 1163066, 1520442, 1700946, 2099202, 2831010, 4020030, 4174170, 4285390, 4516110, 5059890, 5215770 (list; graph; listen)
OFFSET

1,1

MATHEMATICA

Do[If[PowerMod[2, n, n-1]==n-2, Print[n]], {n, 2, 12900000}]

CROSSREFS

Cf. A064935.

Sequence in context: A061999 A066756 A070872 this_sequence A082619 A046399 A082617

Adjacent sequences: A055682 A055683 A055684 this_sequence A055686 A055687 A055688

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research