login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Primes p congruent to 1 mod 16 such that x^8 = 2 has a solution mod p.
2

%I #21 Jun 22 2024 22:27:21

%S 257,337,881,1217,1249,1553,1777,2113,2593,2657,2833,4049,4177,4273,

%T 4481,4513,4721,4993,5297,6353,6449,6481,6529,6689,7121,7489,8081,

%U 8609,9137,9281,9649,10177,10337,10369,10433,10657,11329,11617,11633,12049,12241,12577

%N Primes p congruent to 1 mod 16 such that x^8 = 2 has a solution mod p.

%C For a prime p congruent to 1 mod 16, the number 2 is an octavic residue mod p if and only if there are integers x and y such that x^2 + 256*y^2 = p.

%H Arkadiusz Wesolowski, <a href="/A252279/b252279.txt">Table of n, a(n) for n = 1..10000</a>

%H <a href="/index/Pri#smp">Index entries for related sequences</a>

%o (Magma) [p: p in PrimesUpTo(12577) | p mod 16 eq 1 and exists(t){x : x in ResidueClassRing(p) | x^8 eq 2}]; // _Arkadiusz Wesolowski_, Dec 19 2020

%o (PARI) isok(p) = isprime(p) && (Mod(p, 16) == 1) && ispower(Mod(2, p), 8); \\ _Michel Marcus_, Dec 19 2020

%Y Subsequence of A045315.

%Y Has A070184 as a subsequence.

%K nonn

%O 1,1

%A _Arkadiusz Wesolowski_, Dec 16 2014