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 A209047 #9 Jul 22 2025 21:36:27 %S A209047 4,12,12,36,124,36,108,1300,1300,108,324,13644,47700,13644,324,972, %T A209047 143212,1752148,1752148,143212,972,2916,1503212,64369764,225262148, %U A209047 64369764,1503212,2916,8748,15778340,2364812680,28964458546,28964458546 %N A209047 T(n,k)=Number of nXk 0..3 arrays with no element equal the average of immediate neighbors vertically above and horizontally left of it. %C A209047 Table starts %C A209047 ....4........12............36...............108....................324 %C A209047 ...12.......124..........1300.............13644.................143212 %C A209047 ...36......1300.........47700...........1752148...............64369764 %C A209047 ..108.....13644.......1752148.........225262148............28964458546 %C A209047 ..324....143212......64369764.......28964458546.........13034933066892 %C A209047 ..972...1503212....2364812680.....3724317998214.......5866193355938718 %C A209047 .2916..15778340...86878417604...478881915072688....2640002203816927226 %C A209047 .8748.165616044.3191736905988.61575811582924326.1188097914449381928076 %H A209047 R. H. Hardin, <a href="/A209047/b209047.txt">Table of n, a(n) for n = 1..220</a> %e A209047 Some solutions for n=4 k=3 %e A209047 ..0..3..0....3..1..2....0..2..0....0..1..2....1..3..2....2..0..1....0..1..3 %e A209047 ..1..1..3....1..3..3....3..0..1....3..3..0....2..0..2....0..2..0....1..2..1 %e A209047 ..2..1..1....3..1..3....2..2..1....0..1..1....3..1..1....1..2..2....2..0..2 %e A209047 ..3..1..2....1..3..0....0..2..1....3..3..1....0..1..2....3..0..0....3..1..0 %Y A209047 Column 1 is A003946 %K A209047 nonn,tabl %O A209047 1,1 %A A209047 _R. H. Hardin_ Mar 04 2012