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 A219002 #6 Jul 23 2025 00:09:58 %S A219002 1,2,1,4,10,1,7,46,36,1,12,163,328,126,1,21,604,2265,2374,454,1,37, %T A219002 2341,16648,31857,17776,1632,1,65,9019,127401,462668,461681,131548, %U A219002 5854,1,114,34489,966981,7027671,13259232,6639893,973492,21010,1,200,131968,7298225 %N A219002 T(n,k)=Unmatched value maps: number of nXk binary arrays indicating the locations of corresponding elements not equal to any horizontal, diagonal or antidiagonal neighbor in a random 0..2 nXk array. %C A219002 Table starts %C A219002 .1......2........4..........7..........12..........21..........37...........65 %C A219002 .1.....10.......46........163.........604........2341........9019........34489 %C A219002 .1.....36......328.......2265.......16648......127401......966981......7298225 %C A219002 .1....126.....2374......31857......462668.....7027671...105807897...1583929029 %C A219002 .1....454....17776.....461681....13259232...401608939.12030873701.357976038469 %C A219002 .1...1632...131548....6639893...377629096.22776074699 %C A219002 .1...5854...973492...95431043.10745153084 %C A219002 .1..21010..7213582.1372612359 %C A219002 .1..75412.53429692 %C A219002 .1.270662 %C A219002 .1 %H A219002 R. H. Hardin, <a href="/A219002/b219002.txt">Table of n, a(n) for n = 1..71</a> %e A219002 Some solutions for n=3 k=4 %e A219002 ..1..1..1..0....0..0..1..0....1..0..0..0....1..1..0..1....0..1..0..1 %e A219002 ..0..0..0..0....0..1..0..1....0..1..0..1....0..1..0..0....0..0..1..1 %e A219002 ..1..0..1..0....0..0..1..0....0..0..1..0....0..0..0..0....1..0..0..1 %Y A219002 Column 2 is A202796 %Y A219002 Row 1 is A005251(n+2) %K A219002 nonn,tabl %O A219002 1,2 %A A219002 _R. H. Hardin_ Nov 09 2012