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 A085759 #20 Feb 16 2025 08:32:50
%S A085759 1,5,9,13,17,25,29,37,41,49,53,61,73,81,89,97,101,109,113,121,125,137,
%T A085759 149,157,169,173,181,193,197,229,233,241,257,269,277,281,289,293,313,
%U A085759 317,337,349,353,361,373,389,397,401,409,421,433,449,457,461,509,521
%N A085759 Prime powers of the form 4n+1.
%H A085759 Michael De Vlieger, <a href="/A085759/b085759.txt">Table of n, a(n) for n = 1..10000</a>
%H A085759 Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning, <a href="https://doi.org/10.7151/dmgt.2222">Restrained domination in self-complementary graphs</a>, Preprint, Discussiones Mathematicae Graph Theory (2019), 1-13.
%H A085759 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PaleyGraph.html">Paley Graph</a>
%F A085759 a(n) ~ 2n log n. - _Charles R Greathouse IV_, Jul 12 2018
%t A085759 {1}~Join~Select[1 + 4 Range[130], PrimePowerQ] (* _Michael De Vlieger_, Aug 29 2019 *)
%o A085759 (PARI) list(lim)=my(v=List([1])); forprime(p=5,lim\=1, if(p%4==1, listput(v,p))); for(e=2,logint(lim,3), forprime(p=3,sqrtnint(lim,e), if(e%2==0 || p%4==1, listput(v,p^e)))); Set(v) \\ _Charles R Greathouse IV_, Jul 12 2018
%o A085759 (Magma) [1] cat [4*k+1:k in [1..140]|IsPrimePower(4*k+1)]; // _Marius A. Burtea_, Sep 07 2019
%Y A085759 Subsequence of A000961. A002144 is a subsequence.
%K A085759 nonn,easy
%O A085759 1,2
%A A085759 _Lekraj Beedassy_, Jul 22 2003
%E A085759 Corrected and extended by _Ray Chandler_, Aug 10 2003