Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128122
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128122 Numbers n such that 2^n == 6 (mod n). +0
6
1, 2, 10669, 6611474 (list; graph; listen)
OFFSET

1,2

LINKS

Joe K. Crump, 2^n mod n

CROSSREFS

Cf. A015910, A036236, A050259 = numbers n such that 2^n == 3 (mod n), A033981, A051447, A033982, A051446, A033983, A128121, A128123, A128124, A128125, A128126.

Sequence in context: A086563 A023328 A134656 this_sequence A082178 A082912 A083973

Adjacent sequences: A128119 A128120 A128121 this_sequence A128123 A128124 A128125

KEYWORD

hard,more,nonn

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 15 2007

EXTENSIONS

1 and 2 added by N. J. A. Sloane (njas(AT)research.att.com), Apr 23 2007.

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 December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research