Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125000
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125000 Numbers n such that 2^n (mod n) = 19. +0
4
2873, 10081, 3345113, 420048673, 449349533 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Cf. A124974 2^n (mod n) = 17, A033981 2^n (mod n) = 7, A050259 2^n = 3 (mod n), A124977 Least number m such that 2^m (mod m) = 2n+1, A124965 Odd values of 2^n (mod n) for n's in A015911, A015911 2^n (mod n) is odd, A015910 2^n (mod n).

Cf. A015910, A015911, A033981, A050259, A124965, A124974, A124977, A015910, A015911.

Sequence in context: A045147 A020429 A067703 this_sequence A081427 A101999 A066174

Adjacent sequences: A124997 A124998 A124999 this_sequence A125001 A125002 A125003

KEYWORD

nonn

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), Nov 15 2006

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research