Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A059437
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A059437 Primes p such that x^3 = n (integer) has only one solution mod p. +0
6
2, 3, 5, 11, 17, 23, 29, 41, 47, 53, 59, 71, 83, 89, 101, 107, 113, 131, 137, 149, 167, 173, 179, 191, 197, 227, 233, 239, 251, 257, 263, 269, 281, 293, 311, 317, 347, 353, 359, 383, 389, 401, 419, 431, 443, 449, 461, 467, 479, 491, 503, 509, 521, 557, 563 (list; graph; listen)
OFFSET

1,1

COMMENT

Coincides with sequence A045309 of primes congruent to {0, 2} mod 3. Subsequence of A040028, complement of A014752 relative to A040028. Solutions mod p are represented by integers from 0 to p-1. The solutions are given in A060121.

CROSSREFS

Cf. A045309, A040028, A014752, A060121.

Sequence in context: A040036 A040078 A045309 this_sequence A103664 A129942 A113239

Adjacent sequences: A059434 A059435 A059436 this_sequence A059438 A059439 A059440

KEYWORD

nonn

AUTHOR

Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Mar 02 2001

EXTENSIONS

Description revised by Michel Drouzy (DrouzyM(AT)noos.fr), Oct 28 2001

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research