login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A040095 Primes p such that x^3 = 23 has a solution mod p. 2
2, 3, 5, 11, 17, 23, 29, 31, 37, 41, 47, 53, 59, 61, 71, 83, 89, 101, 103, 107, 109, 113, 131, 137, 139, 149, 157, 163, 167, 173, 179, 191, 193, 197, 211, 227, 233, 239, 241, 251, 257, 263, 269, 271, 281, 293, 311 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Complement of A040096 relative to A000040. - Vincenzo Librandi, Sep 13 2012

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

MATHEMATICA

ok [p_]:=Reduce[Mod[x^3 - 23, p] == 0, x, Integers] =!= False;  Select[Prime[Range[180]], ok] (* Vincenzo Librandi, Sep 11 2012 *)

PROG

(MAGMA) [p: p in PrimesUpTo(450) | exists(t){x : x in ResidueClassRing(p) | x^3 eq 23}]; // Vincenzo Librandi, Sep 11 2012

CROSSREFS

Cf. A000040, A040096.

Sequence in context: A147813 A079545 A154755 * A040028 A049589 A049583

Adjacent sequences:  A040092 A040093 A040094 * A040096 A040097 A040098

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified November 25 18:10 EST 2014. Contains 250000 sequences.