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 A206883 #7 Jul 22 2025 19:46:24 %S A206883 2,4,4,7,16,7,12,49,49,12,21,144,230,144,21,37,441,1011,1011,441,37, %T A206883 65,1369,4705,6478,4705,1369,65,114,4225,22412,44879,44879,22412,4225, %U A206883 114,200,12996,105936,321393,472412,321393,105936,12996,200,351,40000,497727 %N A206883 T(n,k)=Number of nXk 0..1 arrays avoiding 0 1 0 horizontally and 1 0 1 vertically. %C A206883 Table starts %C A206883 ...2.....4......7.......12........21..........37...........65............114 %C A206883 ...4....16.....49......144.......441........1369.........4225..........12996 %C A206883 ...7....49....230.....1011......4705.......22412.......105936.........497727 %C A206883 ..12...144...1011.....6478.....44879......321393......2276625.......15986104 %C A206883 ..21...441...4705....44879....472412.....5179587.....56006452......599130203 %C A206883 ..37..1369..22412...321393...5179587....87541530...1455584860....23905464739 %C A206883 ..65..4225.105936..2276625..56006452..1455584860..37121455086...933389392995 %C A206883 .114.12996.497727.15986104.599130203.23905464739.933389392995.35861331864570 %H A206883 R. H. Hardin, <a href="/A206883/b206883.txt">Table of n, a(n) for n = 1..364</a> %e A206883 Some solutions for n=4 k=3 %e A206883 ..0..0..1....0..1..1....1..0..0....0..0..1....1..0..1....0..1..1....1..1..1 %e A206883 ..0..0..0....1..1..0....0..0..0....0..1..1....0..1..1....0..0..1....1..0..1 %e A206883 ..1..1..0....0..0..0....0..1..1....0..1..1....0..0..1....0..0..1....0..0..1 %e A206883 ..0..1..1....0..0..1....1..1..0....0..1..1....1..0..0....0..0..1....0..1..1 %Y A206883 Column 1 is A005251(n+3) %Y A206883 Column 2 is A188501 %K A206883 nonn,tabl %O A206883 1,1 %A A206883 _R. H. Hardin_ Feb 13 2012