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 A217969 #7 Jul 22 2025 23:45:19 %S A217969 729,6761,672627,27317977,1616011915,87208470529,4947545467377, %T A217969 278677416713235,15749375262438185,889917242514807067, %U A217969 50286796187902721767,2842223316331314740041,160628010365626980414485 %N A217969 Number of 6Xn arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random 0..2 6Xn array. %C A217969 Row 6 of A217964 %e A217969 Some solutions for n=2 %e A217969 ..1..0....2..2....2..2....1..1....1..0....2..1....0..0....0..0....0..0....1..1 %e A217969 ..0..0....0..0....1..1....1..1....0..0....0..0....0..0....0..0....1..2....1..2 %e A217969 ..0..0....0..1....1..2....0..0....1..2....0..1....2..0....0..0....0..0....2..0 %e A217969 ..1..1....1..1....1..1....0..1....2..1....1..1....0..0....0..2....0..1....0..0 %e A217969 ..2..0....1..1....0..0....2..2....0..0....2..2....2..2....2..2....2..1....0..0 %e A217969 ..0..0....1..1....0..2....1..1....0..1....2..2....2..2....2..2....1..1....2..2 %K A217969 nonn %O A217969 1,1 %A A217969 _R. H. Hardin_ Oct 16 2012