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.

A207221 T(n,k)=Number of nXk 0..2 arrays avoiding the pattern z z+1 z in any row or column.

This page as a plain text file.
%I A207221 #7 Jul 22 2025 20:09:01
%S A207221 3,9,9,25,81,25,69,625,625,69,191,4761,12534,4761,191,529,36481,
%T A207221 247163,247163,36481,529,1465,279841,4916282,12584703,4916282,279841,
%U A207221 1465,4057,2146225,97935886,647820815,647820815,97935886,2146225,4057,11235
%N A207221 T(n,k)=Number of nXk 0..2 arrays avoiding the pattern z z+1 z in any row or column.
%C A207221 Table starts
%C A207221 ....3........9..........25.............69................191
%C A207221 ....9.......81.........625...........4761..............36481
%C A207221 ...25......625.......12534.........247163............4916282
%C A207221 ...69.....4761......247163.......12584703..........647820815
%C A207221 ..191....36481.....4916282......647820815........86510224720
%C A207221 ..529...279841....97935886....33403462497.....11574609426324
%C A207221 .1465..2146225..1950327875..1721695415743...1547869995556777
%C A207221 .4057.16459249.38835489653.88730578258613.206971107381598775
%H A207221 R. H. Hardin, <a href="/A207221/b207221.txt">Table of n, a(n) for n = 1..143</a>
%e A207221 Some solutions for n=4 k=3
%e A207221 ..2..0..1....1..2..2....2..2..0....2..0..2....1..1..2....2..1..0....2..1..2
%e A207221 ..2..0..2....0..0..1....0..0..2....1..1..1....1..1..1....2..1..2....1..2..2
%e A207221 ..2..0..2....1..2..0....2..0..0....1..1..0....0..1..2....2..1..1....0..2..1
%e A207221 ..2..0..1....1..2..2....1..0..1....1..2..2....2..1..2....0..1..1....1..1..2
%Y A207221 Column 1 is A098182(n+1)
%Y A207221 Column 2 is A206857
%K A207221 nonn,tabl
%O A207221 1,1
%A A207221 _R. H. Hardin_ Feb 16 2012