Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072989
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072989 Numbers n such that the number of solutions to x^n==1 (mod n) 1<=x<=n is not equal to gcd(n,phi(n)). +0
1
20, 30, 40, 42, 52, 60, 66, 68, 70, 78, 80, 84, 90, 100, 102, 104, 110, 114, 116, 120, 126, 130, 132, 136, 138, 140, 148, 150, 154, 156, 160, 164, 168, 170, 171, 174, 180, 182, 186, 190, 198, 200, 204, 208, 210, 212, 220, 222, 228, 230, 232, 234, 238, 240 (list; graph; listen)
OFFSET

1,1

COMMENT

Conjecture: limit of a(n)/n is zero.

CROSSREFS

Sequence in context: A107714 A029721 A132067 this_sequence A166730 A109944 A108030

Adjacent sequences: A072986 A072987 A072988 this_sequence A072990 A072991 A072992

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 21 2002

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 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research