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 A088817 #17 Feb 16 2025 08:32:51
%S A088817 1,2,3,4,5,9,17,36,157,245,352,3977
%N A088817 Numbers k such that Cyclotomic(2k,k) is prime.
%C A088817 This is a generalization of A056826. Note that (n^n+1)/(n+1) = cyclotomic(2n,n) when n is prime. These are probable primes for n > 352. No others < 4700.
%C A088817 All terms of this sequence that are greater than 3 are congruent to 0 or 1 mod 4. In general, if k = s^2*t where t is squarefree and t == 2, 3 (mod 4), then Cyclotomic(2k,t*x^2) is the product of two polynomials. See the Wikipedia link below. - _Jianing Song_, Sep 25 2019
%H A088817 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CyclotomicPolynomial.html">Cyclotomic Polynomial</a>
%H A088817 Wikipedia, <a href="https://en.wikipedia.org/wiki/Aurifeuillean_factorization">Aurifeuillean factorization</a>
%t A088817 Do[p=Prime[n]; If[PrimeQ[Cyclotomic[2n, n]], Print[p]], {n, 100}]
%o A088817 (PARI) is(n)=ispseudoprime(polcyclo(2*n,n)) \\ _Charles R Greathouse IV_, May 22 2017
%Y A088817 Cf. A056826 ((k^k+1)/(k+1) is prime), A070519 (cyclotomic(k,k) is prime), A088875 (cyclotomic(k,-k) is prime).
%K A088817 hard,nonn
%O A088817 1,2
%A A088817 _T. D. Noe_, Oct 20 2003