cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A045465 Primes congruent to {0, 1} mod 7.

Original entry on oeis.org

7, 29, 43, 71, 113, 127, 197, 211, 239, 281, 337, 379, 421, 449, 463, 491, 547, 617, 631, 659, 673, 701, 743, 757, 827, 883, 911, 953, 967, 1009, 1051, 1093, 1163, 1289, 1303, 1373, 1429, 1471, 1499, 1583
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Magma
    [ p: p in PrimesUpTo(2000) | p mod 7 in {0, 1} ]; // Vincenzo Librandi, Aug 13 2012
  • Mathematica
    Select[Prime[Range[200]],MemberQ[{0,1},Mod[#,7]]&] (* Vincenzo Librandi, Aug 13 2012 *)

A216881 Primes p such that x^7 = 3 has a solution mod p.

Original entry on oeis.org

2, 3, 5, 7, 11, 13, 17, 19, 23, 31, 37, 41, 47, 53, 59, 61, 67, 73, 79, 83, 89, 97, 101, 103, 107, 109, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 199, 223, 227, 229, 233, 241, 251, 257, 263, 269, 271, 277, 283, 293, 307, 311, 313, 317
Offset: 1

Views

Author

Vincenzo Librandi, Sep 19 2012

Keywords

Comments

Complement of A042969 relative to A000040.
Differs from A042966 first at index 98. - R. J. Mathar, Mar 13 2013

Programs

  • Magma
    [p: p in PrimesUpTo(500) | exists(t){x: x in ResidueClassRing(p) | x^7 eq 3}];
  • Mathematica
    ok[p_] := Reduce[Mod[x^7 - 3, p] == 0, x, Integers] =!= False; Select[Prime[Range[150]], ok]
Showing 1-2 of 2 results.