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.

A263370 Number of (n+1)X(5+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 A263370 #4 Oct 16 2015 07:32:17
%S A263370 10,112,9888,826249,84790557,8491666657,883978450474,92359613590072,
%T A263370 9695725030142616,1017738982928794777,106860144447454638429,
%U A263370 11219638590333541521601,1178048734539490226212450
%N A263370 Number of (n+1)X(5+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 A263370 Column 5 of A263373.
%H A263370 R. H. Hardin, <a href="/A263370/b263370.txt">Table of n, a(n) for n = 1..210</a>
%e A263370 Some solutions for n=3
%e A263370 ..2..0..2..0..2..0....1..0..2..0..1..1....2..2..0..0..1..0....1..1..1..0..2..0
%e A263370 ..1..0..1..0..1..0....1..1..1..0..2..0....2..2..0..2..2..0....0..0..0..1..1..2
%e A263370 ..2..2..0..2..2..0....2..1..2..2..1..2....1..1..2..1..1..2....0..0..2..1..2..1
%e A263370 ..1..1..0..1..1..0....0..2..1..1..1..2....2..2..1..0..1..1....1..1..2..2..1..0
%Y A263370 Cf. A263373.
%K A263370 nonn
%O A263370 1,1
%A A263370 _R. H. Hardin_, Oct 16 2015