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 A207182 #7 Jul 22 2025 20:05:26 %S A207182 2,4,4,7,16,7,13,49,49,12,24,169,241,144,21,44,576,1393,1171,441,37, %T A207182 81,1936,7915,11227,5917,1369,65,149,6561,44065,105836,95299,30067, %U A207182 4225,114,274,22201,248525,981850,1507355,816667,151981,12996,200,504,75076 %N A207182 T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 horizontally and 0 1 0 vertically. %C A207182 Table starts %C A207182 ...2.....4......7.......13.........24...........44.............81 %C A207182 ...4....16.....49......169........576.........1936...........6561 %C A207182 ...7....49....241.....1393.......7915........44065.........248525 %C A207182 ..12...144...1171....11227.....105836.......981850........9196215 %C A207182 ..21...441...5917....95299....1507355.....23471595......368714705 %C A207182 ..37..1369..30067...816667...21722593....567046841....14960137403 %C A207182 ..65..4225.151981..6951227..310484943..13575513917...600838995529 %C A207182 .114.12996.767377.59040685.4425513760.324280404464.24069606968809 %H A207182 R. H. Hardin, <a href="/A207182/b207182.txt">Table of n, a(n) for n = 1..312</a> %e A207182 Some solutions for n=4 k=3 %e A207182 ..0..0..1....0..1..0....0..1..1....0..0..1....1..0..0....1..0..0....1..1..1 %e A207182 ..0..0..1....1..0..1....0..1..1....0..0..1....0..0..1....1..0..1....1..1..0 %e A207182 ..1..1..1....1..0..1....0..1..1....1..0..1....1..0..1....1..0..1....1..0..1 %e A207182 ..1..1..0....1..1..0....0..1..1....1..0..0....1..1..1....1..0..1....1..1..1 %Y A207182 Column 1 is A005251(n+3) %Y A207182 Column 2 is A188501 %Y A207182 Row 1 is A000073(n+3) %Y A207182 Row 2 is A085697(n+1) %Y A207182 Row 3 is A207089 %K A207182 nonn,tabl %O A207182 1,1 %A A207182 _R. H. Hardin_ Feb 15 2012