A262797 Number of (2+2)X(n+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.

0, 144, 528, 4704, 56880, 787536, 8423568, 98893920, 1186930800, 14416385040, 171393010320, 2053738997856, 24644935370160, 296067439483344, 3550012697702544, 42596001968362080, 511152044529285360

Offset

1,2

Comments

Row 2 of A262795.

Links

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

Formula

Empirical: a(n) = 14*a(n-1) -52*a(n-2) +440*a(n-3) +1940*a(n-4) -42136*a(n-5) +130832*a(n-6) -1272928*a(n-7) +234026*a(n-8) +34403252*a(n-9) -63189880*a(n-10) +952057808*a(n-11) -516283820*a(n-12) -10970711960*a(n-13) +9550612240*a(n-14) -282398311520*a(n-15) +96140026255*a(n-16) +1404615957550*a(n-17) -501871284980*a(n-18) +34714525551160*a(n-19) -5440122625184*a(n-20) -68377213321664*a(n-21) +6191483638912*a(n-22) -1653436086997760*a(n-23) +68472989925120*a(n-24) +824525429054976*a(n-25) -5699099907072*a(n-26) +19800008497133568*a(n-27) -63128491278336*a(n-28) -757541895340032*a(n-29) -18181005488160768*a(n-31)

Example

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

Crossrefs

Cf. A262795.

Sequence in context: A281240 A014770 A131528 * A017402 A155707 A017522

Adjacent sequences: A262794 A262795 A262796 * A262798 A262799 A262800

Keyword

nonn

Author

R. H. Hardin, Oct 02 2015

Status

approved