login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 1

%I #4 Oct 16 2015 07:32:17

%S 10,112,9888,826249,84790557,8491666657,883978450474,92359613590072,

%T 9695725030142616,1017738982928794777,106860144447454638429,

%U 11219638590333541521601,1178048734539490226212450

%N 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 Column 5 of A263373.

%H R. H. Hardin, <a href="/A263370/b263370.txt">Table of n, a(n) for n = 1..210</a>

%e Some solutions for n=3

%e ..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 ..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 ..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 ..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 Cf. A263373.

%K nonn

%O 1,1

%A _R. H. Hardin_, Oct 16 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 09:56 EDT 2024. Contains 371967 sequences. (Running on oeis4.)