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 A280673 #4 Jan 07 2017 08:07:44 %S A280673 1,2,2,4,11,5,11,59,82,14,30,338,858,612,41,82,1917,10205,12484,4568, %T A280673 122,224,10893,119440,310365,181640,34096,365,612,61880,1401470, %U A280673 7533245,9439606,2642832,254496,1094,1672,351541,16438612,183331502,474736149 %N A280673 T(n,k)=Number of nXk 0..2 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards. %C A280673 Table starts %C A280673 ....1.........2............4..............11...............30................82 %C A280673 ....2........11...........59.............338.............1917.............10893 %C A280673 ....5........82..........858...........10205...........119440...........1401470 %C A280673 ...14.......612........12484..........310365..........7533245.........183331502 %C A280673 ...41......4568.......181640.........9439606........474736149.......23952262535 %C A280673 ..122.....34096......2642832.......287101721......29920114246.....3130289979912 %C A280673 ..365....254496.....38452768......8732086113....1885698283255...409089889172506 %C A280673 .1094...1899584....559481408....265582964074..118845116023725.53463025958093933 %C A280673 .3281..14178688...8140361856...8077601392565.7490149091439288 %C A280673 .9842.105831168.118440917248.245677069239189 %H A280673 R. H. Hardin, <a href="/A280673/b280673.txt">Table of n, a(n) for n = 1..97</a> %F A280673 Empirical for column k: %F A280673 k=1: a(n) = 4*a(n-1) -3*a(n-2) %F A280673 k=2: a(n) = 8*a(n-1) -4*a(n-2) for n>3 %F A280673 k=3: a(n) = 14*a(n-1) +8*a(n-2) %F A280673 k=4: a(n) = 29*a(n-1) +44*a(n-2) -27*a(n-3) -81*a(n-4) for n>5 %F A280673 k=5: [order 8] for n>9 %F A280673 k=6: [order 20] for n>22 %F A280673 Empirical for row n: %F A280673 n=1: a(n) = 2*a(n-1) +2*a(n-2) for n>4 %F A280673 n=2: a(n) = 5*a(n-1) +6*a(n-2) -11*a(n-3) -7*a(n-4) +4*a(n-5) for n>6 %F A280673 n=3: [order 18] for n>20 %F A280673 n=4: [order 73] for n>78 %e A280673 Some solutions for n=3 k=4 %e A280673 ..0..1..0..0. .0..1..0..2. .0..1..0..1. .0..0..1..0. .0..1..1..0 %e A280673 ..0..1..2..1. .2..0..2..1. .0..2..1..0. .2..2..1..1. .2..0..2..0 %e A280673 ..1..2..0..0. .2..1..0..2. .2..0..2..0. .1..0..2..2. .1..0..1..1 %Y A280673 Column 1 is A007051(n-1). %Y A280673 Column 2 is A209094. %Y A280673 Row 1 is A021006(n-3). %K A280673 nonn,tabl %O A280673 1,2 %A A280673 _R. H. Hardin_, Jan 07 2017