cp's OEIS Frontend

A263797 Number of (n+1) X (6+1) 0..1 arrays with each row and column divisible by 3, read as a binary number with top and left being the most significant bits, and rows and columns lexicographically nonincreasing.

%I A263797 #6 Oct 13 2021 05:31:52
%S A263797 4,4,14,18,130,616,4991,30130,185795,1022105,5241463,25403916,
%T A263797 113461481,487306269,1945016957,7506601812,27247184895,95846215581,
%U A263797 320539609724,1040469247149,3239110764205,9802122015937,28643481268593,81494869102471
%N A263797 Number of (n+1) X (6+1) 0..1 arrays with each row and column divisible by 3, read as a binary number with top and left being the most significant bits, and rows and columns lexicographically nonincreasing.
%H A263797 R. H. Hardin, <a href="/A263797/b263797.txt">Table of n, a(n) for n = 1..210</a>
%H A263797 R. H. Hardin, <a href="/A263797/a263797.txt">Empirical recurrence of order 83</a>
%F A263797 Empirical recurrence of order 83 (see link above)
%e A263797 Some solutions for n=5
%e A263797 ..1..1..0..0..0..0..0....1..1..1..1..0..0..0....1..1..1..1..0..0..0
%e A263797 ..1..1..0..0..0..0..0....1..1..0..0..1..1..0....1..1..1..1..0..0..0
%e A263797 ..0..0..1..1..1..1..0....1..0..1..0..1..1..1....1..1..1..1..0..0..0
%e A263797 ..0..0..1..1..1..1..0....1..0..0..1..0..0..0....1..1..1..1..0..0..0
%e A263797 ..0..0..0..0..0..0..0....0..1..1..0..0..0..0....1..1..0..0..0..0..0
%e A263797 ..0..0..0..0..0..0..0....0..1..0..0..0..0..1....1..1..0..0..0..0..0
%Y A263797 Column 6 of A263799.
%K A263797 nonn
%O A263797 1,1
%A A263797 _R. H. Hardin_, Oct 26 2015