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

%I #4 Oct 11 2015 20:51:08

%S 366629,12652497,398648507,11542428929,333834894509,9669206035811,

%T 281744631338581,8168432979144243,236803228434060000,

%U 6872338129370139753,199369625571670867675,5782741479669647970363,167698271515683910798963

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

%C Column 2 of A263198.

%H R. H. Hardin, <a href="/A263196/b263196.txt">Table of n, a(n) for n = 1..70</a>

%e Some solutions for n=1

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

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

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

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

%Y Cf. A263198.

%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 April 25 06:14 EDT 2024. Contains 371964 sequences. (Running on oeis4.)