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 A208713 #7 Jul 22 2025 21:29:33 %S A208713 32,2048,67228,2587924,96373248,3613193828,135288700496,5066922301172, %T A208713 189760457060980,7106753308593540,266155856593675476, %U A208713 9967837469474701148,373306752240786865244,13980758919336720329676,523595189388352085042024 %N A208713 Number of 6Xn 0..1 arrays with new values 0..1 introduced in row major order and no element equal to more than two of its immediate leftward or upward or right-upward antidiagonal neighbors. %C A208713 Row 6 of A208709 %H A208713 R. H. Hardin, <a href="/A208713/b208713.txt">Table of n, a(n) for n = 1..210</a> %F A208713 Empirical: a(n) = 33*a(n-1) +263*a(n-2) -3223*a(n-3) -18036*a(n-4) +125510*a(n-5) +521961*a(n-6) -2559903*a(n-7) -7083315*a(n-8) +29279065*a(n-9) +41849338*a(n-10) -177571622*a(n-11) -69714760*a(n-12) +472051228*a(n-13) -17024841*a(n-14) -616904041*a(n-15) +139939476*a(n-16) +429455960*a(n-17) -134077368*a(n-18) -166807014*a(n-19) +56749363*a(n-20) +37221787*a(n-21) -12479641*a(n-22) -4662939*a(n-23) +1470709*a(n-24) +288889*a(n-25) -88672*a(n-26) -5330*a(n-27) +2180*a(n-28) -112*a(n-29) for n>33 %e A208713 Some solutions for n=4 %e A208713 ..0..1..0..1....0..1..1..1....0..0..0..0....0..1..1..0....0..0..0..1 %e A208713 ..0..0..1..0....1..0..1..1....0..1..0..1....1..0..1..1....0..1..0..0 %e A208713 ..1..1..1..0....1..1..0..1....0..1..1..0....0..1..0..1....1..1..0..0 %e A208713 ..0..1..1..0....1..1..0..1....1..0..0..1....0..0..1..1....0..0..1..1 %e A208713 ..1..0..0..1....0..1..1..0....1..0..0..1....1..0..0..1....0..1..0..1 %e A208713 ..1..0..1..1....0..0..1..1....0..1..1..1....0..1..1..1....1..0..1..0 %K A208713 nonn %O A208713 1,1 %A A208713 _R. H. Hardin_ Mar 01 2012