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.

A263365 Number of (n+1)X(n+1) 0..2 arrays with each row and column divisible by 7, read as a base-3 number with top and left being the most significant digits.

This page as a plain text file.
%I A263365 #4 Oct 16 2015 07:27:23
%S A263365 1,2,82,24711,84790557,2535097569590
%N A263365 Number of (n+1)X(n+1) 0..2 arrays with each row and column divisible by 7, read as a base-3 number with top and left being the most significant digits.
%C A263365 Diagonal of A263373.
%e A263365 Some solutions for n=4
%e A263365 ..1..2..0..1..2....2..0..0..2..0....0..1..1..2..0....0..0..1..1..2
%e A263365 ..2..0..2..0..2....1..2..2..2..2....2..1..0..2..1....0..2..0..0..2
%e A263365 ..0..1..2..1..1....0..2..1..0..0....2..2..1..2..0....1..2..2..2..2
%e A263365 ..1..1..1..0..2....2..1..0..0..0....1..0..0..1..0....1..1..2..2..1
%e A263365 ..2..1..2..1..0....1..2..0..1..2....2..0..1..1..1....2..2..0..0..1
%Y A263365 Cf. A263373.
%K A263365 nonn
%O A263365 1,2
%A A263365 _R. H. Hardin_, Oct 16 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.