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