cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A263056 #4 Oct 08 2015 14:59:13
%S A263056 10,895,18390,498597,10416690,232738767,4880746710,104100946101,
%T A263056 2185333961490,46071984907935,967423105276470,20335923462641157,
%U A263056 427044510774483570,8970161111918918127,188372284635598141590
%N A263056 Number of (n+1)X(4+1) 0..1 arrays with each row and column not divisible by 3, read as a binary number with top and left being the most significant bits.
%C A263056 Column 4 of A263060.
%H A263056 R. H. Hardin, <a href="/A263056/b263056.txt">Table of n, a(n) for n = 1..210</a>
%F A263056 Empirical: a(n) = 21*a(n-1) +189*a(n-2) -3969*a(n-3) -10719*a(n-4) +225099*a(n-5) +250803*a(n-6) -5266863*a(n-7) -2527200*a(n-8) +53071200*a(n-9) +9062928*a(n-10) -190321488*a(n-11)
%e A263056 Some solutions for n=3
%e A263056 ..1..0..0..1..1....0..0..0..1..0....0..0..1..1..1....0..0..0..0..1
%e A263056 ..0..0..1..0..0....1..1..0..0..1....1..1..0..0..1....1..0..1..0..0
%e A263056 ..1..1..0..1..0....1..1..1..0..0....0..1..0..1..1....0..1..1..1..0
%e A263056 ..0..0..0..1..0....1..1..0..0..1....0..1..0..1..0....1..0..1..0..0
%Y A263056 Cf. A263060.
%K A263056 nonn
%O A263056 1,1
%A A263056 _R. H. Hardin_, Oct 08 2015