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.

A263793 Number of (n+1) X (n+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.

This page as a plain text file.
%I A263793 #8 Jan 24 2025 18:34:33
%S A263793 2,2,7,7,61,616,62904,20141827
%N A263793 Number of (n+1) X (n+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.
%C A263793 Diagonal of A263799.
%e A263793 Some solutions for n=5:
%e A263793 ..1..1..1..1..0..0....1..1..1..1..0..0....1..1..1..1..0..0....1..1..1..1..0..0
%e A263793 ..1..1..1..1..0..0....1..1..0..0..1..1....1..1..1..1..0..0....1..1..1..1..0..0
%e A263793 ..1..1..0..0..1..1....1..0..1..0..1..0....0..0..0..0..1..1....1..1..0..0..0..0
%e A263793 ..1..1..0..0..1..1....1..0..0..1..0..0....0..0..0..0..1..1....1..1..0..0..0..0
%e A263793 ..0..0..0..0..1..1....0..0..1..0..0..1....0..0..0..0..1..1....1..0..1..0..1..0
%e A263793 ..0..0..0..0..1..1....0..0..0..0..0..0....0..0..0..0..1..1....1..0..1..0..1..0
%Y A263793 Cf. A263799.
%K A263793 nonn,more
%O A263793 1,1
%A A263793 _R. H. Hardin_, Oct 26 2015

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.