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 A205255 #7 Jul 22 2025 18:42:07 %S A205255 16,40,40,112,168,112,328,752,752,328,976,3416,5212,3416,976,2920, %T A205255 15568,36304,36304,15568,2920,8752,71000,253072,387328,253072,71000, %U A205255 8752,26248,323856,1764364,4136296,4136296,1764364,323856,26248,78736,1477272 %N A205255 T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with the number of clockwise edge increases in every 2X2 subblock the same. %C A205255 Table starts %C A205255 ....16......40......112........328..........976...........2920.............8752 %C A205255 ....40.....168......752.......3416........15568..........71000...........323856 %C A205255 ...112.....752.....5212......36304.......253072........1764364.........12301024 %C A205255 ...328....3416....36304.....387328......4136296.......44183032........471988176 %C A205255 ...976...15568...253072....4136296.....67731268.....1109832184......18189909484 %C A205255 ..2920...71000..1764364...44183032...1109832184....27913330476.....702420750928 %C A205255 ..8752..323856.12301024..471988176..18189909484...702420750928...27149753088796 %C A205255 .26248.1477272.85762192.5042151648.298154846440.17679917387408.1049837466171440 %H A205255 R. H. Hardin, <a href="/A205255/b205255.txt">Table of n, a(n) for n = 1..420</a> %e A205255 Some solutions for n=4 k=3 %e A205255 ..0..1..1..0....1..0..0..1....1..1..0..0....0..0..1..1....1..1..1..1 %e A205255 ..0..0..0..0....0..0..1..1....1..0..0..1....1..0..0..0....0..0..1..0 %e A205255 ..0..1..1..1....1..0..1..0....0..0..1..1....0..0..1..1....0..1..1..1 %e A205255 ..1..1..0..1....0..0..0..0....1..0..0..1....0..1..1..0....1..1..0..1 %e A205255 ..0..1..1..1....0..1..0..1....1..1..0..1....1..1..0..0....0..1..1..1 %K A205255 nonn,tabl %O A205255 1,1 %A A205255 _R. H. Hardin_ Jan 24 2012