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.

A228479 Number of n X 5 binary arrays with top left value 1 and no two ones adjacent horizontally, vertically or antidiagonally.

Original entry on oeis.org

5, 19, 127, 728, 4354, 25699, 152373, 902042, 5342712, 31639786, 187379548, 1109702480, 6571916787, 38920392611, 230495519461, 1365047364511, 8084124028133, 47876038862427, 283532896714060, 1679146925634733
Offset: 1

Views

Author

R. H. Hardin, Aug 22 2013

Keywords

Comments

Same recurrences as A228285 except in addition this smaller one for this column.

Examples

			Some solutions for n=4:
..1..0..1..0..0....1..0..0..0..0....1..0..0..0..0....1..0..1..0..0
..0..0..0..1..0....0..0..0..0..1....0..0..0..0..0....0..0..0..1..0
..1..0..0..0..1....1..0..0..0..0....1..0..0..0..0....1..0..0..0..0
..0..0..1..0..0....0..0..0..0..0....0..0..0..1..0....0..1..0..0..1
		

Crossrefs

Column 5 of A228482.

Formula

Empirical: a(n) = 3*a(n-1) + 15*a(n-2) + 16*a(n-3) - 11*a(n-4) - 20*a(n-5) + 19*a(n-6) - 8*a(n-7) + a(n-9).
Empirical g.f.: x*(5 + 4*x - 5*x^2 - 18*x^3 + 16*x^4 - 6*x^5 + x^7) / (1 - 3*x - 15*x^2 - 16*x^3 + 11*x^4 + 20*x^5 - 19*x^6 + 8*x^7 - x^9). - Colin Barker, Sep 11 2018