cp's OEIS Frontend

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.

A207989 T(n,k)=Number of nXk 0..2 arrays avoiding the pattern z z+1 z horizontally and z z-1 z vertically.

This page as a plain text file.
%I A207989 #7 Jul 22 2025 21:05:32
%S A207989 3,9,9,25,81,25,69,625,625,69,191,4761,12468,4761,191,529,36481,
%T A207989 244325,244325,36481,529,1465,279841,4827482,12271227,4827482,279841,
%U A207989 1465,4057,2146225,95527856,622569385,622569385,95527856,2146225,4057,11235
%N A207989 T(n,k)=Number of nXk 0..2 arrays avoiding the pattern z z+1 z horizontally and z z-1 z vertically.
%C A207989 Table starts
%C A207989 ....3........9..........25.............69................191
%C A207989 ....9.......81.........625...........4761..............36481
%C A207989 ...25......625.......12468.........244325............4827482
%C A207989 ...69.....4761......244325.......12271227..........622569385
%C A207989 ..191....36481.....4827482......622569385........81269646503
%C A207989 ..529...279841....95527856....31638012071.....10629041648848
%C A207989 .1465..2146225..1889730415..1607243845009...1389619561706920
%C A207989 .4057.16459249.37378616643.81641053794111.181656690367717549
%H A207989 R. H. Hardin, <a href="/A207989/b207989.txt">Table of n, a(n) for n = 1..127</a>
%e A207989 Some solutions for n=4 k=3
%e A207989 ..2..2..0....2..1..0....1..2..2....2..1..0....0..0..0....2..1..2....1..2..2
%e A207989 ..0..0..2....2..1..2....0..0..1....0..1..1....2..0..2....1..2..2....2..1..2
%e A207989 ..2..0..0....2..1..1....2..2..0....1..0..2....2..0..1....0..2..1....2..0..1
%e A207989 ..1..0..1....0..1..1....1..2..2....1..2..2....0..0..0....2..1..0....2..2..1
%Y A207989 Column 1 is A098182(n+1)
%Y A207989 Column 2 is A206857
%K A207989 nonn,tabl
%O A207989 1,1
%A A207989 _R. H. Hardin_ Feb 22 2012