Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056740
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056740 Odd solutions x to 2^x mod x = 2^(x+2) mod (x-2). +0
1
135, 1423249, 31491395, 55519333, 1065373685 (list; graph; listen)
OFFSET

0,1
LINKS

Joe K. Crump, 2^n mod n

EXAMPLE

a(1) = 135 because 2^135 mod 135 = 53 and 2^137 mod 133 = 53.

CROSSREFS

Sequence in context: A132054 A106175 A051307 this_sequence A065663 A072884 A072889

Adjacent sequences: A056737 A056738 A056739 this_sequence A056741 A056742 A056743

KEYWORD

nonn

AUTHOR

Joe K. Crump (joecr(AT)carolina.rr.com), Aug 25 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 August 29 17:54 EDT 2008. Contains 143238 sequences.

AT&T Labs Research

Legal Notice
© 2007 AT&T Knowledge Ventures. All Rights Reserved.