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 A325908 #10 Oct 07 2019 16:25:36
%S A325908 1,1,1,2,2,4,7,12,22,40,76,142,268,500,944,1788,3389,6444,12286,23464
%N A325908 The largest k such that an integer x between 1 and k (inclusive) can be guessed in at most n queries "is x < y?" with one lie.
%D A325908 S. M. Ulam, "Adventures of a Mathematician", Scribner’s, 1976.
%H A325908 A. Pelc, <a href="https://doi.org/10.1016/0097-3165(87)90065-3">Solution of Ulam’s Problem on searching with a lie</a>, J. Combinatorial Theory, Series A, vol. 44 (1987), 129-140.
%Y A325908 Cf. A286496 (with queries about membership of an arbitrary set instead of a set {x < y}).
%K A325908 nonn,more
%O A325908 0,4
%A A325908 _Mikhail Tikhomirov_, Sep 08 2019