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 A322548 #14 Dec 16 2018 12:58:55
%S A322548 1,11,19,29,61,701
%N A322548 Integers x such that x^2 + 119 = 15*2^y.
%C A322548 The exponents y of the corresponding powers of 2 are 3, 4, 5, 6, 8, 15.
%C A322548 The list gives all positive integers x such that x^2 + 119 = 15*2^y.
%C A322548 Yann Bugeaud proposed the problem to prove that there is an absolute constant C such that, for any positive integers D, k and a prime number p such that gcd(D, kp) = 1, the Diophantine equation x^2 + D = k*p^n has at most C integer solutions (x, n) (Problem 9 of the list of 22 open problems below).
%H A322548 Jan-Hendrik Evertse, <a href="https://www.math.leidenuniv.nl/~evertse/07-workshop-problems.pdf">Some open problems about Diophantine equations</a>, 22 problems posed at the Instructional conference and workshop "Solvability of Diophantine equations", May 7-16, 2007, Lorentz Center, Leiden.
%H A322548 Jörg Stiller, <a href="https://doi.org/10.1216/rmjm/1181072117">The Diophantine equation x^2 + 119 = 15*2^n has exactly six solutions</a>, Rocky Mountain J. Math. 26 (1996), 295-298.
%e A322548 a(2) = 11: 11^2 + 119 = 240 = 15*2^4.
%t A322548 s={}; Do[r = Solve[x^2 + 119 == 15*2^k && x >= 0, x, Integers]; If[Length[r]>0, AppendTo[s, x/.r[[1]]]], {k,1,15}]; s (* _Amiram Eldar_, Dec 15 2018 *)
%Y A322548 Cf. A038198 (All solutions to x^2 + 7 = 2^y).
%K A322548 nonn,fini,full
%O A322548 1,2
%A A322548 _Tomohiro Yamada_, Dec 14 2018