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 A367998 #7 Dec 21 2023 15:41:27 %S A367998 1,1,2,8,388,2495,13652575732976,1580140554389506598141638, %T A367998 2303282945504494379369753334706333784257298061180917309, %U A367998 1116351824215919296474220471583292515147278170740521646743561595082143234790184233409933250330039986837258312677349601942095851 %N A367998 Numerator of the greatest probability that a particular free polyomino with n cells appears as the image of a simple random walk on the square lattice. %C A367998 a(n) is the numerator of the maximum of A367994/A367995 over the n-th row. See A367994 for details. %H A367998 Pontus von Brömssen, <a href="/A367998/b367998.txt">Table of n, a(n) for n = 1..13</a>. %H A367998 <a href="/index/Pol#polyominoes">Index entries for sequences related to polyominoes</a>. %e A367998 For 1 <= n <= 13, the following are all polyominoes that have the maximum probabilities for their respective sizes. Except for n = 7, there is just one such polyomino. %e A367998 _ _ _ _ %e A367998 _ _ | | | |_ | | %e A367998 _ | | | |_ | |_ | | | | %e A367998 |_| |_| |_ _| |_ _| |_ _| |_ _| %e A367998 _ _ _ %e A367998 _ _ | |_ _ _ _| | %e A367998 | | | | | |_ | _| %e A367998 | |_ | | | | | | %e A367998 |_ _ _| |_ _| |_ _ _| |_ _| %e A367998 _ _ _ _ _ _ _ _ _ %e A367998 | | | |_ _| |_ _| | %e A367998 | |_ | | | | | _| %e A367998 | | | | | _ _| | | %e A367998 |_ _ _| |_ _ _| |_ _| |_ _ _| %Y A367998 Cf. A367673, A367762, A367994, A367995, A367996, A367999 (denominators), A368004. %K A367998 nonn,frac %O A367998 1,3 %A A367998 _Pontus von Brömssen_, Dec 08 2023