Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A033983
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A033983 Numbers n such that 2^n (mod n) = 15. +0
10
481, 44669, 1237231339, 1546675117, 62823773963, 284876771881, 1119485807557 (list; graph; listen)
OFFSET

0,1

LINKS

Joe K. Crump, 2^n mod n

CROSSREFS

Cf. A125000 2^n (mod n) = 19, A124974 2^n (mod n) = 17, A033982 2^n (mod n) = 11, 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, A033982, A125000.

Sequence in context: A020271 A165384 A165376 this_sequence A158329 A121734 A158330

Adjacent sequences: A033980 A033981 A033982 this_sequence A033984 A033985 A033986

KEYWORD

nonn

AUTHOR

Joe K. Crump (joecr(AT)carolina.rr.com)

EXTENSIONS

One more term from Joe K. Crump (joecr(AT)carolina.rr.com), Jun 20 2000

Edited by N. J. A. Sloane (njas(AT)research.att.com), Jul 03 2008 at the suggestion of R. J. Mathar

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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 20 09:10 EDT 2010. Contains 173642 sequences.


AT&T Labs Research