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 A206252 #7 Jul 22 2025 19:21:02 %S A206252 47089,26512201,944701696,226637884225,14139111560401, %T A206252 2261195747329024,186370092021300625,24455901146017548025, %U A206252 2314068144009520254976,275508832683852646545601,27911391658467202945715041 %N A206252 Number of (n+1)X6 0..3 arrays with every 2X2 subblock having zero permanent. %C A206252 Column 5 of A206255 %H A206252 R. H. Hardin, <a href="/A206252/b206252.txt">Table of n, a(n) for n = 1..210</a> %F A206252 Empirical: a(n) = 133*a(n-1) +6888*a(n-2) -1340811*a(n-3) +4226391*a(n-4) +4180767372*a(n-5) -80490770091*a(n-6) -5217648903441*a(n-7) +148692944523528*a(n-8) +2437871310147447*a(n-9) -99376895146018923*a(n-10) -199651087166898780*a(n-11) +26256479575727404800*a(n-12) -103833901082736072000*a(n-13) -2123373038352913440000*a(n-14) +13177032454057536000000*a(n-15) %e A206252 Some solutions for n=4 %e A206252 ..1..2..2..0..3..2....3..2..3..1..1..2....2..2..2..2..3..2....1..3..3..1..2..0 %e A206252 ..0..0..0..0..0..0....0..0..0..0..0..0....0..0..0..0..0..0....0..0..0..0..0..0 %e A206252 ..0..0..2..3..0..1....3..0..1..1..2..0....1..3..2..3..1..0....2..2..0..1..3..2 %e A206252 ..1..0..0..0..0..1....2..0..0..0..0..0....0..0..0..0..0..0....0..0..0..0..0..0 %e A206252 ..0..0..1..0..0..2....3..0..0..1..2..3....2..3..0..3..3..0....1..3..3..3..2..3 %K A206252 nonn %O A206252 1,1 %A A206252 _R. H. Hardin_ Feb 05 2012