Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A121912
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A121912 Numbers n such that 10^n == 10 modulo n. +0
3
1, 2, 3, 5, 6, 7, 9, 10, 11, 13, 15, 17, 18, 19, 23, 29, 30, 31, 33, 37, 41, 43, 45, 47, 53, 55, 59, 61, 67, 71, 73, 79, 83, 89, 90, 91, 97, 99, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 165, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227 (list; graph; listen)
OFFSET

1,2

FORMULA

By Fermat, all primes are members.

EXAMPLE

13 is here because 10^13 = 13*769230769230 + 10.

MATHEMATICA

Select[Range[250], PowerMod[10, #, # ] == Mod[10, # ] &] (*Chandler*)

CROSSREFS

Cf. A056969 = 10^n modulo n, A121014.

Sequence in context: A099308 A074235 A001948 this_sequence A120514 A101886 A135674

Adjacent sequences: A121909 A121910 A121911 this_sequence A121913 A121914 A121915

KEYWORD

nonn

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), Sep 02 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 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research