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 A290642 #46 Mar 05 2024 07:02:19
%S A290642 3,7,13,14,15,18
%N A290642 a(n) is the maximum diameter for an n-threaded binary program. In other words, a(n) is the maximal finite distance in the transition graph of an n-threaded binary program.
%C A290642 Here, a binary n-threaded program is a multithreaded program with n threads, two local states per thread, and 2 shared states.
%C A290642 Conjecture: a(n) = 3*n for all n >= 5.
%H A290642 Alexander Malkis, <a href="http://wwwbroy.in.tum.de/~malkis/Malkis_-_Reachability_in_Multithreaded_Programs_Is_Polynomial_in_the_Number_of_Threads_techrep.pdf">Reachability in Multithreaded Programs Is Polynomial in the Number of Threads (Version with Proofs)</a>, Technical University of Munich (Germany, 2019).
%H A290642 Alexander Malkis and Steffen Borgwardt, <a href="http://doi.org/10.1109/ICDCS.2017.290">Reachability in Binary Multithreaded Programs Is Polynomial</a>, ICDCS'17, IEEE, 2017, pages 2083-2088.
%F A290642 a(n) >= 3*n for all n >= 1.
%F A290642 a(n) <= n^{2^{13}} for all n >= 2.
%Y A290642 A008585(n) <= a(n) for all n >= 1.
%K A290642 nonn,hard,more
%O A290642 1,1
%A A290642 _Alexander Malkis_, Aug 08 2017
%E A290642 Name edited by _Michel Marcus_, Jan 02 2020