Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128123
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128123 Numbers n such that 2^n == 10 (mod n). +0
6
1, 2, 6, 18, 16666, 262134, 4048124214, 24430928839, 3935632929857549, 266895924489780149, 2335291686841914329, 18494453435532853111 (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, A128122, A128124, A128125, A128126.

Sequence in context: A052687 A056743 A064535 this_sequence A058081 A034533 A014559

Adjacent sequences: A128120 A128121 A128122 this_sequence A128124 A128125 A128126

KEYWORD

hard,more,nonn

AUTHOR

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

EXTENSIONS

1, 2 and 6 added by njas, 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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research