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

%I

%S 0,42,504,6960,113028,1428036,21015946,282937866,3899304030,

%T 54249804504,760179391290,10624299994980,148755958233888,

%U 2082595517998488,29160130611965550,408200027705513862,5715110419878541186

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

%C Row 1 of A263288.

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

%e Some solutions for n=4

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

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

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

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

%Y Cf. A263288.

%K nonn

%O 1,2

%A _R. H. Hardin_, Oct 13 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 July 6 15:30 EDT 2022. Contains 355110 sequences. (Running on oeis4.)