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

36, 144, 625, 2601, 10404, 41616, 167281, 670761, 2683044, 10732176, 42941809, 171793449, 687173796, 2748695184, 10994990449, 43980381225, 175921524900, 703686099600, 2814747753841, 11258997726249, 45035990904996

Offset

1,1

Links

R. H. Hardin, Table of n, a(n) for n = 1..210

Formula

Empirical: a(n) = 6*a(n-1) - 12*a(n-2) + 24*a(n-3) - 31*a(n-4) - 6*a(n-5) + 12*a(n-6) - 24*a(n-7) + 32*a(n-8).

Empirical g.f.: x*(36 - 72*x + 193*x^2 - 285*x^3 - 42*x^4 + 84*x^5 - 184*x^6 + 288*x^7) / ((1 - x)*(1 + x)*(1 - 2*x)*(1 - 4*x)*(1 + x^2)*(1 + 4*x^2)). - Colin Barker, Jan 01 2019

Example

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

Crossrefs

Column 2 of A262795.

Sequence in context: A016910 A005017 A288488 * A110754 A299854 A154711

Adjacent sequences: A262786 A262787 A262788 * A262790 A262791 A262792

Keyword

nonn

Author

R. H. Hardin, Oct 02 2015

Status

approved