Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A074243
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A074243 Integers which allow a unique modular cube root function. A positive integer n is in the sequence if x^3 (modulo n) describes a bijection from the set [0...n-1] to itself. +0
1
1, 2, 3, 5, 6, 10, 11, 15, 17, 22, 23, 29, 30, 33, 34, 41, 46, 47, 51, 53, 55, 58, 59, 66, 69, 71, 82, 83, 85, 87, 89, 94, 101, 102, 106, 107, 110, 113, 115, 118, 123, 131, 137, 138, 141, 142, 145, 149, 159, 165, 166, 167, 170, 173, 174, 177, 178, 179, 187, 191, 197 (list; graph; listen)
OFFSET

0,2

COMMENT

Every member of the sequence is squarefree. If m & n are coprime members of the sequence, m*n is also a member.

EXAMPLE

The number 30 is in the sequence because the function x^3 (mod 30) describes a bijection from [0...29] to itself. Thus every integer has a cube root, modulo 30.

CROSSREFS

Sequence in context: A063451 A076474 A057760 this_sequence A072720 A018396 A003238

Adjacent sequences: A074240 A074241 A074242 this_sequence A074244 A074245 A074246

KEYWORD

easy,nonn

AUTHOR

Jack Brennen (jb(AT)brennen.net), Sep 19 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 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research