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 A368661 #13 Jan 24 2024 16:43:58 %S A368661 1,0,1,0,0,0,0,0,4,0,0,0,2,0,0,0,0,7,5,0,0,0,0,3,4,1,0,0,0,0,1,6,2,0, %T A368661 0,0,0,0,2,2,7,8,0,0,0 %N A368661 Square array read by antidiagonals; the n-th row is the decimal expansion of the minimum probability that a particular free polyomino with n cells appears in diffusion-limited aggregation on the square lattice. %C A368661 The n-th row is the decimal expansion of the minimum of the numbers corresponding to rows A130866(n-1)+1..A130866(n) of A368660. See A368660 for details. %H A368661 <a href="/index/Pol#polyominoes">Index entries for sequences related to polyominoes</a>. %e A368661 Array begins: %e A368661 1.00000000000000000000... (1st row of A368660) %e A368661 1.00000000000000000000... (2nd row of A368660) %e A368661 0.42731251091162151298... (4th row of A368660) %e A368661 0.05462942885357382723... (6th row of A368660) %e A368661 0.01279646275569121440... (20th row of A368660) %e A368661 0.00867204327624784314... (42nd row of A368660) %e A368661 ... %e A368661 The corresponding polyominoes for 1 <= n <= 6 are (all these are unique): %e A368661 _ _ _ _ %e A368661 _ | | _ _ _| |_ _| _| %e A368661 _ | | | | | | |_ _| _| _| %e A368661 |_| |_| |_| |_ _| |_| |_ _| %Y A368661 Cf. A130866, A368388 (internal diffusion-limited aggregation), A368660, A368662 (maximum), A368664 (row 3), A368666 (row 4), A368864 (fixed polyominoes). %K A368661 nonn,tabl,cons,more %O A368661 1,9 %A A368661 _Pontus von Brömssen_, Jan 04 2024