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

%I #4 Oct 12 2015 17:17:26

%S 366629,12652497,365832647,10595045187,306234039025,8971344440493,

%T 259877539798060,7558319565205403,219503638927712079,

%U 6370066248057714293,184726447984445515275,5358013099014479637987,155381832153450791875837

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

%C Column 2 of A263238.

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

%e Some solutions for n=1

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

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

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

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

%Y Cf. A263238.

%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 March 29 10:44 EDT 2024. Contains 371268 sequences. (Running on oeis4.)