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 A198661 #7 Jul 22 2025 13:03:50 %S A198661 0,1,1,1,3,1,2,14,14,2,3,76,185,76,3,6,488,3904,3904,488,6,11,3521, %T A198661 98467,344044,98467,3521,11,23,28030,3053286,40065880,40065880, %U A198661 3053286,28030,23,47,242883,109133049,6046334324,22693251873,6046334324,109133049 %N A198661 T(n,k)=Number of nXk 0..7 arrays with values 0..7 introduced in row major order and each element equal to at least one horizontal or vertical neighbor. %C A198661 Table starts %C A198661 ...0.......1..........1.............2..............3..............6 %C A198661 ...1.......3.........14............76............488...........3521 %C A198661 ...1......14........185..........3904..........98467........3053286 %C A198661 ...2......76.......3904........344044.......40065880.....6046334324 %C A198661 ...3.....488......98467......40065880....22693251873.17510670291958 %C A198661 ...6....3521....3053286....6046334324.17510670291958 %C A198661 ..11...28030..109133049.1099981072751 %C A198661 ..23..242883.4460603630 %C A198661 ..47.2267306 %C A198661 .103 %H A198661 R. H. Hardin, <a href="/A198661/b198661.txt">Table of n, a(n) for n = 1..59</a> %e A198661 Some solutions with all values 0 to 7 for n=6 k=3 %e A198661 ..0..1..2....0..1..1....0..1..1....0..1..1....0..1..1....0..1..1....0..1..2 %e A198661 ..0..1..2....0..2..2....0..2..2....0..2..3....0..0..0....0..2..3....0..1..2 %e A198661 ..3..0..4....3..3..3....3..3..4....4..2..3....2..3..3....0..2..3....3..4..5 %e A198661 ..3..0..4....3..4..4....5..2..4....4..4..5....2..4..4....4..5..5....3..4..5 %e A198661 ..5..5..6....5..6..7....5..2..6....6..6..5....5..6..7....4..5..6....0..0..6 %e A198661 ..7..7..6....5..6..7....7..7..6....7..7..5....5..6..7....7..7..6....7..7..6 %K A198661 nonn,tabl %O A198661 1,5 %A A198661 _R. H. Hardin_ Oct 28 2011