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 A207467 #7 Jul 22 2025 20:27:50 %S A207467 2,4,4,6,16,6,9,36,36,10,13,81,98,100,16,18,169,271,358,256,26,25,324, %T A207467 677,1307,1152,676,42,34,625,1504,4219,5369,3910,1764,68,46,1156,3399, %U A207467 11760,21517,23645,12994,4624,110,62,2116,7220,33393,71928,119965,101233 %N A207467 T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 1 0 and 1 0 1 vertically. %C A207467 Table starts %C A207467 ..2....4.....6......9......13.......18........25........34.........46 %C A207467 ..4...16....36.....81.....169......324.......625......1156.......2116 %C A207467 ..6...36....98....271.....677.....1504......3399......7220......15184 %C A207467 .10..100...358...1307....4219....11760.....33393.....88198.....229458 %C A207467 .16..256..1152...5369...21517....71928....247631....778010....2406006 %C A207467 .26..676..3910..23645..119965...491948...2090927...7990970...29983194 %C A207467 .42.1764.12994.101233..644401..3205650..16675001..76629370..345252578 %C A207467 .68.4624.43596.439063.3523073.21396734.136803627.760840082.4139073950 %H A207467 R. H. Hardin, <a href="/A207467/b207467.txt">Table of n, a(n) for n = 1..337</a> %e A207467 Some solutions for n=4 k=3 %e A207467 ..0..1..0....1..1..0....0..0..1....1..1..1....0..1..0....0..0..1....0..0..1 %e A207467 ..1..0..0....1..0..1....0..1..0....1..1..0....1..1..0....0..1..0....1..0..0 %e A207467 ..1..0..1....1..0..1....0..1..0....1..0..0....1..1..1....1..1..0....1..1..0 %e A207467 ..1..1..1....0..1..0....0..1..0....1..0..1....1..0..1....1..0..0....0..1..0 %Y A207467 Column 1 is A006355(n+2) %Y A207467 Column 2 is A206981 %Y A207467 Row 1 is A171861(n+1) %Y A207467 Row 2 is A207025 %Y A207467 Row 3 is A207112 %K A207467 nonn,tabl %O A207467 1,1 %A A207467 _R. H. Hardin_ Feb 18 2012