Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060591
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060591 Integers i > 1 for which there is no prime p such that i is a solution mod p of x^3 = 2. +0
3
113, 128, 194, 283, 333, 338, 376, 403, 430, 450, 491, 503, 548, 578, 722, 866, 875, 906, 1008, 1102, 1243, 1244, 1256, 1260, 1365, 1368, 1371, 1392, 1453, 1478, 1529, 1537, 1675, 1718, 1802, 1805, 1911, 1926, 1971, 2051, 2084, 2108, 2132, 2153, 2163 (list; graph; listen)
OFFSET

1,1

COMMENT

Solutions mod p are represented by integers from 0 to p-1. The following equivalences holds for i > 1: There is a prime p such that i is a solution mod p of x^3 = 2 iff i^3-2 has a prime factor > i; i is a solution mod p of x^3 = 2 iff p is a prime factor of i^3-2 and p > i.

FORMULA

Integer i > 1 is a term of this sequence iff i^3-2 has no prime factor > i.

EXAMPLE

a(1) = 113, since there is no prime p such that 113 is a solution mod p of x^3 = 2 and for each integer i from 2 to 112 there is a prime q such that i is a solution mod q of x^3 = 2 (cf. A059940).

CROSSREFS

A040028, A059940.

Sequence in context: A054033 A167843 A159466 this_sequence A069488 A131648 A163760

Adjacent sequences: A060588 A060589 A060590 this_sequence A060592 A060593 A060594

KEYWORD

nonn

AUTHOR

Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Apr 06 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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 19 13:18 EDT 2010. Contains 173632 sequences.


AT&T Labs Research