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.

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

This page as a plain text file.
%I A206863 #7 Jul 22 2025 19:44:22
%S A206863 3,9,9,25,81,25,69,625,625,69,191,4761,11092,4761,191,529,36481,
%T A206863 192575,192575,36481,529,1465,279841,3425501,7598355,3425501,279841,
%U A206863 1465,4057,2146225,61164640,314918295,314918295,61164640,2146225,4057,11235
%N A206863 T(n,k)=Number of nXk 0..2 arrays avoiding the pattern z z+1 z in any row, column, diagonal or antidiagonal.
%C A206863 Table starts
%C A206863 ....3........9..........25.............69...............191
%C A206863 ....9.......81.........625...........4761.............36481
%C A206863 ...25......625.......11092.........192575...........3425501
%C A206863 ...69.....4761......192575........7598355.........314918295
%C A206863 ..191....36481.....3425501......314918295.......31208037240
%C A206863 ..529...279841....61164640....13093461017.....3092914364659
%C A206863 .1465..2146225..1090023439...541018725304...303316860005399
%C A206863 .4057.16459249.19411973287.22336434688428.29725367062521082
%H A206863 R. H. Hardin, <a href="/A206863/b206863.txt">Table of n, a(n) for n = 1..111</a>
%e A206863 Some solutions for n=4 k=3
%e A206863 ..2..0..2....2..1..2....1..2..2....0..0..0....0..1..2....1..1..2....2..0..1
%e A206863 ..1..1..1....1..2..2....1..1..1....2..0..2....1..2..0....1..1..1....2..0..2
%e A206863 ..1..1..0....0..2..1....1..0..1....2..0..1....1..2..0....0..1..2....1..0..2
%e A206863 ..1..2..2....1..1..2....2..1..2....0..0..0....2..0..2....2..1..2....1..2..2
%Y A206863 Column 1 is A098182(n+1)
%K A206863 nonn,tabl
%O A206863 1,1
%A A206863 _R. H. Hardin_ Feb 13 2012