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!)
A263153 Number of (n+3)X(1+3) 0..1 arrays with each row and column not divisible by 9, read as a binary number with top and left being the most significant bits. 1

%I #5 Oct 11 2015 08:35:56

%S 23966,323572,4345200,63755349,913603171,12918908831,180717447506,

%T 2526833145412,35334275421824,495175192858165,6936152367154135,

%U 97125217002643101,1359727874296720126,19035465628546193860

%N Number of (n+3)X(1+3) 0..1 arrays with each row and column not divisible by 9, read as a binary number with top and left being the most significant bits.

%C Column 1 of A263156.

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

%e Some solutions for n=1

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

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

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

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

%Y Cf. A263156.

%K nonn

%O 1,1

%A _R. H. Hardin_, Oct 11 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 August 18 04:36 EDT 2024. Contains 375255 sequences. (Running on oeis4.)