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.
%I A097934 #30 Oct 13 2022 13:56:59
%S A097934 5,19,23,29,43,47,53,67,71,73,97,101,139,149,163,167,173,191,193,197,
%T A097934 211,239,241,263,269,283,293,307,311,313,317,331,337,359,379,383,389,
%U A097934 409,431,433,457,461,479,499,503,509,523,547,557,571,577,599,601,619
%N A097934 Primes p that divide 3^((p-1)/2) - 2^((p-1)/2).
%C A097934 Rational primes that decompose in the field Q(sqrt(6)). - _N. J. A. Sloane_, Dec 26 2017
%C A097934 All terms belong to A038876(n) = Primes p such that 6 is a square mod p. Only first two terms of A038876(n), 2 and 3, do not belong to a(n). - _Alexander Adamchuk_, May 04 2007
%C A097934 From _Jianing Song_, Oct 13 2022: (Start)
%C A097934 Primes p such that kronecker(6,p) = 1 (or equivalently, kronecker(24,p) = 1).
%C A097934 Primes congruent to 1, 5, 9, 23 modulo 24. (End)
%H A097934 Vincenzo Librandi, <a href="/A097934/b097934.txt">Table of n, a(n) for n = 1..1000</a>
%H A097934 <a href="https://oeis.org/wiki/Index_to_OEIS:_Section_Pri#primes_decomp_of">Index to sequences related to decomposition of primes in quadratic fields</a>
%F A097934 a(n) = A038876(n+1). - _Alexander Adamchuk_, May 04 2007
%e A097934 For p=5, 3^2 - 2^2 = 5.
%t A097934 okQ[n_]:=Module[{c=(n-1)/2},Divisible[3^c-2^c,n]]; Select[Prime[Range[200]],okQ] (* _Harvey P. Dale_, Apr 13 2011 *)
%o A097934 (PARI) /* Set x=3,d=1,s=-1 */
%o A097934 ptopm1d2(n,x,d,s) = { forprime(p=3,n,p2=(p-1)/2; y=x^p2 + s*(x-d)^p2; if(y%p==0,print1(p", "))) }
%o A097934 (PARI) isA097934(p) == isprime(p) && kronecker(6,p) == 1 \\ _Jianing Song_, Oct 13 2022
%Y A097934 Cf. A038876 (primes p such that 6 is a square mod p), A038877 (rational primes that remain inert in the field Q(sqrt(6))).
%K A097934 nonn,easy
%O A097934 1,1
%A A097934 _Cino Hilliard_, Sep 04 2004