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 A206255 #10 Apr 18 2023 09:44:36 %S A206255 49,361,361,1600,8029,1600,9409,99856,99856,9409,47089,1718209, %T A206255 1364224,1718209,47089,258064,26512201,49336576,49336576,26512201, %U A206255 258064,1343281,434613664,944701696,4556324929,944701696,434613664,1343281,7198489 %N A206255 T(n,k) = Number of (n+1) X (k+1) 0..3 arrays with every 2 X 2 subblock having zero permanent. %C A206255 Table starts %C A206255 ......49..........361...........1600..............9409................47089 %C A206255 .....361.........8029..........99856...........1718209.............26512201 %C A206255 ....1600........99856........1364224..........49336576............944701696 %C A206255 ....9409......1718209.......49336576........4556324929.........226637884225 %C A206255 ...47089.....26512201......944701696......226637884225.......14139111560401 %C A206255 ..258064....434613664....27285753856....16533087493120.....2261195747329024 %C A206255 .1343281...6990799321...603269103616..1006239668280961...186370092021300625 %C A206255 .7198489.113636628469.15860529270784.68438717405988481.24455901146017548025 %H A206255 R. H. Hardin, <a href="/A206255/b206255.txt">Table of n, a(n) for n = 1..611</a> %F A206255 Column 1 is A006130(n+2)^2. %e A206255 Some solutions for n=4, k=3 %e A206255 ..2..0..3..3....0..0..1..1....0..3..3..0....0..0..0..0....0..2..0..3 %e A206255 ..0..0..0..0....3..0..0..0....0..0..0..0....3..0..1..1....0..0..0..1 %e A206255 ..2..1..1..0....3..0..1..1....1..0..1..0....2..0..0..0....1..0..0..1 %e A206255 ..0..0..0..0....1..0..0..0....1..0..0..0....3..0..2..0....0..0..0..3 %e A206255 ..2..1..1..0....3..0..0..2....2..0..2..3....2..0..3..0....1..0..0..1 %Y A206255 Cf. A006130. %K A206255 nonn,tabl %O A206255 1,1 %A A206255 _R. H. Hardin_, Feb 05 2012