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 A368864 #7 Jan 10 2024 23:55:19 %S A368864 1,0,0,0,5,0,0,0,1,0,0,0,4,0,0,0,0,3,3,0,0,0,0,1,7,0,0,0,0,0,7,9,9,0, %T A368864 0,0,0,0,1,4,3,2,0,0,0 %N A368864 Square array read by antidiagonals; the n-th row is the decimal expansion of the minimum probability that a particular fixed polyomino with n cells appears in diffusion-limited aggregation on the square lattice. %C A368864 The n-th row is the decimal expansion of the minimum of the numbers corresponding to rows A130866(n-1)+1..A130866(n) of A368863. %C A368864 It seems that the zig-zag polyomino is the unique n-celled polyomino that has the minimum probability of appearing in a fixed orientation. %H A368864 <a href="/index/Pol#polyominoes">Index entries for sequences related to polyominoes</a>. %e A368864 Array begins: %e A368864 1.00000000000000000000... (1st row of A368863) %e A368864 0.50000000000000000000... (2nd row of A368863) %e A368864 0.14317187227209462175... (3rd row of A368863) %e A368864 0.03794485956843370668... (8th row of A368863) %e A368864 0.00933365290110550590... (12th row of A368863) %e A368864 0.00216801081906196078... (42nd row of A368863) %e A368864 ... %e A368864 The corresponding polyominoes for 1 <= n <= 6 are (all these are unique): %e A368864 _ _ _ %e A368864 _ _ _ _ _| | _| _| %e A368864 _ | | _| | _| _| _| _| _| _| %e A368864 |_| |_| |_ _| |_ _| |_ _| |_ _| %Y A368864 Cf. A130866, A368661 (free polyominoes), A368863, A368865 (maximum). %K A368864 nonn,tabl,cons,more %O A368864 1,5 %A A368864 _Pontus von Brömssen_, Jan 08 2024