

A007519


Primes of form 8n+1, that is, primes congruent to 1 mod 8.
(Formerly M5037)


99



17, 41, 73, 89, 97, 113, 137, 193, 233, 241, 257, 281, 313, 337, 353, 401, 409, 433, 449, 457, 521, 569, 577, 593, 601, 617, 641, 673, 761, 769, 809, 857, 881, 929, 937, 953, 977, 1009, 1033, 1049, 1097, 1129, 1153, 1193, 1201, 1217, 1249, 1289, 1297, 1321, 1361
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

Discriminant is 32, class is 2. Binary quadratic forms ax^2 + bxy + cy^2 have discriminant d = b^2  4ac and gcd(a, b, c) = 1.
Integers n (n > 9) of form 4k + 1 such that binomial(n1, (n1)/4) == 1 (mod n)  Benoit Cloitre, Feb 07 2004
Primes of the form x^2 + 8y^2.  T. D. Noe, May 07 2005
Is this the same sequence as A141174?
Being a subset of A001132 and also a subset of A038873, this is also a subset of the primes of the form u^2  2v^2.  Tito Piezas III, Dec 28 2008
These primes p are only which possess the property: for every integer m from interval [0, p) with the Hamming distance D(m, p) = 2, there exists an integer h from (m, p) with D(m, h) = 2.  Vladimir Shevelev, Apr 18 2012
Primes p such that p XOR 6 = p + 6.  Brad Clardy, Jul 22 2012
Odd primes p such that 1 is a 4th power mod p.  Eric M. Schmidt, Mar 27 2014
There are infinitely many primes of this form. See Brubaker link.  Alonso del Arte, Jan 12 2017
These primes split in Z[sqrt(2)]. For example, 17 = (1)(1  3*sqrt(2))(1 + 3*sqrt(2)). This is also true of primes of the form 8n  1.  Alonso del Arte, Jan 26 2017


REFERENCES

Milton Abramowitz and Irene A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 870.
Z. I. Borevich and I. R. Shafarevich, Number Theory.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).


LINKS

Milton Abramowitz and Irene A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].


EXAMPLE

a(1) = 17 = 2 * 8 + 1 = (10001)_2. All numbers m from [0, 17) with the Hamming distance D(m, 17) = 2 are 0, 3, 5, 9. For m = 0, we can take h = 3, since 3 is drawn from (0, 17) and D(0, 3) = 2; for m = 3, we can take h = 5, since 5 from (3, 17) and D(3, 5) = 2; for m = 5, we can take h = 6, since 6 from (5, 17) and D(5, 6) = 2; for m = 9, we can take h = 10, since 10 is drawn from (9, 17) and D(9, 10) = 2.  Vladimir Shevelev, Apr 18 2012


MATHEMATICA



PROG

(Haskell)
a007519 n = a007519_list !! (n1)
a007519_list = filter ((== 1) . a010051) [1, 9..]
(Magma) [p: p in PrimesUpTo(2000)  p mod 8 eq 1 ]; // Vincenzo Librandi, Aug 21 2012
(PARI) lista(nn) = { my(vpr = []); for (x = 0, nn, y = 0; while ((v = x^2+6*x*y+y^2) < nn, if (isprime(v), if (! vecsearch(vpr, v), vpr = concat(vpr, v); vpr = vecsort(vpr); ); ); y++; ); ); vpr; } \\ Michel Marcus, Feb 01 2014
(Sage) # uses[binaryQF]
# The function binaryQF is defined in the link 'Binary Quadratic Forms'.
Q = binaryQF([1, 4, 4])
print(Q.represented_positives(1361, 'prime')) # Peter Luschny, Jan 26 2017


CROSSREFS

For a list of sequences giving numbers and/or primes represented by binary quadratic forms, see the "Binary Quadratic Forms and OEIS" link.


KEYWORD

nonn,easy


AUTHOR



STATUS

approved



