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.

Original entry on oeis.org

10, 895, 18390, 498597, 10416690, 232738767, 4880746710, 104100946101, 2185333961490, 46071984907935, 967423105276470, 20335923462641157, 427044510774483570, 8970161111918918127, 188372284635598141590
Offset: 1

Views

Author

R. H. Hardin, Oct 08 2015

Keywords

Comments

Column 4 of A263060.

Examples

			Some solutions for n=3
..1..0..0..1..1....0..0..0..1..0....0..0..1..1..1....0..0..0..0..1
..0..0..1..0..0....1..1..0..0..1....1..1..0..0..1....1..0..1..0..0
..1..1..0..1..0....1..1..1..0..0....0..1..0..1..1....0..1..1..1..0
..0..0..0..1..0....1..1..0..0..1....0..1..0..1..0....1..0..1..0..0
		

Crossrefs

Cf. A263060.

Formula

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)