Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A104381
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A104381 Numbers n such that 10^(n-1) == 1 (mod n). +0
1
1, 3, 7, 9, 11, 13, 17, 19, 23, 29, 31, 33, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 91, 97, 99, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 259, 263 (list; graph; listen)
OFFSET

1,2

COMMENT

Superset of the full reptend primes.

LINKS

Eric Weisstein's World of Mathematics, Full Reptend Prime

MATHEMATICA

Select[ Range[270], Mod[ PowerMod[10, # - 1, # ] - 1, # ] == 0 &] (from Robert G. Wilson v Mar 16 2005)

CROSSREFS

Sequence in context: A069254 A105585 A080903 this_sequence A136333 A134454 A113522

Adjacent sequences: A104378 A104379 A104380 this_sequence A104382 A104383 A104384

KEYWORD

nonn

AUTHOR

Eric Weisstein (eric(AT)weisstein.com), Mar 03, 2005

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research