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!)
A263221 Number of (n+1) X (5+1) 0..2 arrays with each row and column divisible by 5, read as a base-3 number with top and left being the most significant digits. 1

%I

%S 13,1920,198892,22342751,3126162435,456363243352,66317081173996,

%T 9651690803653879,1408397535551222617,205625917583136780312,

%U 30019612862946349286716,4382688566369987885721551

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

%C Column 5 of A263224.

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

%e Some solutions for n=3

%e ..0..1..1..1..2..2....0..2..2..1..1..2....1..0..2..0..1..0....0..1..0..2..2..0

%e ..2..0..0..2..2..0....1..0..2..0..1..0....0..2..2..0..1..1....2..1..0..0..1..0

%e ..2..1..2..1..1..2....2..0..1..1..1..0....1..0..2..0..1..0....0..1..0..2..2..0

%e ..1..0..2..2..0..0....0..1..0..0..1..1....0..2..2..0..1..1....2..1..0..0..1..0

%Y Cf. A263224.

%K nonn

%O 1,1

%A _R. H. Hardin_, Oct 12 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 October 5 10:09 EDT 2022. Contains 357255 sequences. (Running on oeis4.)