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 A257916 #17 Jun 08 2015 05:07:59
%S A257916 0,0,0,0,0,3350529,33640210792449,2852374425137128275969,
%T A257916 46730819857678988884581779099803448292025618771438557470916609
%N A257916 a(n) is the largest x that is a member of a pair (x, y) of integers with x - y > 1 such that x^2 - y^2 is equal to the Fermat number 2^(2^n) + 1, or 0 if no such number exists.
%C A257916 2^(2^n) + 1 belongs to A019434 if and only if a(n) = 0.
%D A257916 M. Krizek, F. Luca, L. Somer, 17 Lectures on Fermat Numbers: From Number Theory to Geometry, CMS Books in Mathematics, vol. 9, Springer-Verlag, New York, 2001, p. 6.
%H A257916 Wikipedia, <a href="http://en.wikipedia.org/wiki/Fermat_number">Fermat number</a>
%F A257916 If F(n) = 2^(2^n) + 1 is composite, then a(n) = (A032742(F(n)) + A093179(n))/2.
%o A257916 (PARI) a(n) = {my(fn = 2^(2^n) + 1); if (isprime(fn), return (0)); my(spf = factor(fn)[1,1]); (fn/spf + spf)/2;} \\ _Michel Marcus_, Jun 07 2015
%Y A257916 Cf. A000215, A257917.
%K A257916 nonn
%O A257916 0,6
%A A257916 _Arkadiusz Wesolowski_, May 12 2015