cp's OEIS Frontend

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.

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.

Original entry on oeis.org

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, 0, 0, 0, 0, 2, 2, 7, 8, 0, 0, 0
Offset: 1

Views

Author

Pontus von Brömssen, Jan 04 2024

Keywords

Comments

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.

Examples

			Array begins:
  1.00000000000000000000... (1st row of A368660)
  1.00000000000000000000... (2nd row of A368660)
  0.42731251091162151298... (4th row of A368660)
  0.05462942885357382723... (6th row of A368660)
  0.01279646275569121440... (20th row of A368660)
  0.00867204327624784314... (42nd row of A368660)
  ...
The corresponding polyominoes for 1 <= n <= 6 are (all these are unique):
            _             _          _ _
       _   | |   _ _    _| |_      _|  _|
  _   | |  | |  |   |  |_   _|   _|  _|
 |_|  |_|  |_|  |_ _|    |_|    |_ _|
		

Crossrefs

Cf. A130866, A368388 (internal diffusion-limited aggregation), A368660, A368662 (maximum), A368664 (row 3), A368666 (row 4), A368864 (fixed polyominoes).