Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049048
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049048 n composite, k! == 1 (mod n) for some k > 2. +0
2
119, 121, 221, 299, 391, 527, 901, 961, 1387, 1643, 1829, 2047, 2627, 3569, 5083, 9641, 9869, 10379, 11449, 16337, 16517, 18349, 22577, 23267, 23999, 25199, 27931, 28471, 31877, 32989, 33431, 37127, 40319, 47029, 48827, 50933, 52777, 55277 (list; graph; listen)
OFFSET

1,1

COMMENT

Conjecture: If c is composite then n! == 1 (mod c) for at most one n >= 2. - David Wilson, Oct 06 2009

LINKS

D. Wilson, Table of n, a(n) for n=0..1000

CROSSREFS

Sequence in context: A013476 A013683 A071843 this_sequence A124074 A103154 A039557

Adjacent sequences: A049045 A049046 A049047 this_sequence A049049 A049050 A049051

KEYWORD

nonn

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

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 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research