Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A055694
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A055694 11^n (mod n-1) = -1. +0
1
2, 3, 5, 7, 13, 62, 75, 378, 637, 2295, 10933, 24255, 31125, 50787, 53685, 55575, 176565, 193242, 243165, 290675, 415215, 579397, 728035, 728742, 741015, 760410, 1281423, 1447515, 1664205, 1975974, 4020030, 4794075, 5778525, 7189014 (list; graph; listen)
OFFSET

1,1

MATHEMATICA

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

CROSSREFS

Adjacent sequences: A055691 A055692 A055693 this_sequence A055695 A055696 A055697

Sequence in context: A072826 A084761 A038965 this_sequence A007311 A031345 A114625

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