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 A213353 #19 Jan 05 2025 19:51:39
%S A213353 44745755,1812338107,9266824499,12308871853,13657352875,22767480811,
%T A213353 22930161667,24068927659,25549554505,25770503549,57939582163,
%U A213353 90219135299,90329609821,96949951147,103126759951
%N A213353 A subset of numbers n such that n^4 is a Sierpinski number.
%C A213353 A sequence constructed from Izotov's trick.
%C A213353 If n belongs to this sequence and n does not end in 5, then n^4 has the covering set {3, 5, 17, 97, 241, 257, 673}.
%H A213353 Anatoly S. Izotov, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/33-3/izotov.pdf">A note on Sierpinski numbers</a>
%H A213353 Wikipedia, <a href="http://en.wikipedia.org/wiki/Sierpinski_number">Sierpinski number</a>
%t A213353 (* even if nn is increased, no additional terms are generated *) nn = 14; lst = {}; n = 44745755; p = 2^12; m = 3*(p^4 - 1)/(p - 1); Do[a = n + (-1)^c*m; n = a/GCD[a, p]; AppendTo[lst, Abs@n], {c, 0, nn}]; Union@lst
%Y A213353 Subset of A233469. Cf. A076336.
%K A213353 nonn,easy,fini,full
%O A213353 1,1
%A A213353 _Arkadiusz Wesolowski_, Jun 09 2012