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 A207000 #7 Jul 22 2025 19:55:30 %S A207000 2,4,4,7,16,7,12,49,49,12,21,144,230,144,20,37,441,1011,1020,400,33, %T A207000 65,1369,4705,6612,4120,1089,54,114,4225,22412,45932,38144,16109,2916, %U A207000 88,200,12996,105936,329734,382349,211471,61003,7744,143,351,40000,497727 %N A207000 T(n,k)=Number of nXk 0..1 arrays avoiding 0 1 0 horizontally and 0 1 1 vertically. %C A207000 Table starts %C A207000 ..2....4......7......12........21.........37...........65...........114 %C A207000 ..4...16.....49.....144.......441.......1369.........4225.........12996 %C A207000 ..7...49....230....1011......4705......22412.......105936........497727 %C A207000 .12..144...1020....6612.....45932.....329734......2346621......16555996 %C A207000 .20..400...4120...38144....382349....3997768.....41429335.....424457832 %C A207000 .33.1089..16109..211471...3032756...45723467....683241763...10070110597 %C A207000 .54.2916..61003.1124120..22816988..490003769..10432265840..218637649146 %C A207000 .88.7744.227197.5856490.167677230.5103567157.154004233160.4567604720632 %H A207000 R. H. Hardin, <a href="/A207000/b207000.txt">Table of n, a(n) for n = 1..338</a> %e A207000 Some solutions for n=4 k=3 %e A207000 ..0..0..1....1..1..0....0..0..1....0..0..1....1..1..1....1..0..0....0..1..1 %e A207000 ..0..0..0....1..0..1....0..1..1....0..0..1....1..1..1....0..0..1....1..0..0 %e A207000 ..1..0..1....1..0..0....1..0..0....0..0..1....0..1..1....1..0..0....0..0..1 %e A207000 ..0..0..0....0..1..1....0..0..0....1..1..1....0..1..1....0..1..1....1..1..0 %Y A207000 Column 1 is A000071(n+3) %Y A207000 Column 2 is A188516 %Y A207000 Column 3 is A206780 %Y A207000 Row 1 is A005251(n+3) %Y A207000 Row 2 is A188501 %Y A207000 Row 3 is A206878 %K A207000 nonn,tabl %O A207000 1,1 %A A207000 _R. H. Hardin_ Feb 14 2012