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 A368865 #9 Jan 10 2024 23:55:15 %S A368865 1,0,0,0,5,0,0,0,2,0,0,0,1,0,0,0,0,3,8,0,0,0,0,6,1,2,0,0,0,0,5,3,8,0, %T A368865 0,0,0,0,6,9,3,9,0,0,0 %N A368865 Square array read by antidiagonals; the n-th row is the decimal expansion of the maximum probability that a particular fixed polyomino with n cells appears in diffusion-limited aggregation on the square lattice. %C A368865 The n-th row is the decimal expansion of the maximum of the numbers corresponding to rows A130866(n-1)+1..A130866(n) of A368863. %C A368865 It seems that the straight polyomino is the unique n-celled polyomino that has the maximum probability of appearing in a fixed orientation. If true, the n-th row here equals the A130866(n)-th row of A368863. %H A368865 <a href="/index/Pol#polyominoes">Index entries for sequences related to polyominoes</a>. %e A368865 Array begins: %e A368865 1.00000000000000000000... (1st row of A368863) %e A368865 0.50000000000000000000... (2nd row of A368863) %e A368865 0.21365625545581075649... (4th row of A368863) %e A368865 0.08139812221208792734... (9th row of A368863) %e A368865 0.02831865405554939733... (21st row of A368863) %e A368865 0.00913650301189504691... (56th row of A368863) %e A368865 ... %Y A368865 Cf. A130866, A368394 (internal diffusion-limited aggregation), A368662 (free polyominoes), A368863, A368864 (minimum). %K A368865 nonn,tabl,cons,more %O A368865 1,5 %A A368865 _Pontus von Brömssen_, Jan 08 2024