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.

A261379 Number of (n+2)X(7+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00001011 00010101 or 01010101.

This page as a plain text file.
%I A261379 #4 Aug 17 2015 08:32:24
%S A261379 392,864,3778,12500,39494,128998,461576,1468008,5004588,16267396,
%T A261379 56289594,180787146,623643757,2013680076,6945409809,22381289794,
%U A261379 77243050853,249062829770,859199611263,2770077481724,9558157038040
%N A261379 Number of (n+2)X(7+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00001011 00010101 or 01010101.
%C A261379 Column 7 of A261380.
%H A261379 R. H. Hardin, <a href="/A261379/b261379.txt">Table of n, a(n) for n = 1..210</a>
%F A261379 Empirical: a(n) = a(n-2) +91*a(n-4) +334*a(n-6) -779*a(n-8) -3685*a(n-10) +7226*a(n-12) +20922*a(n-14) -62627*a(n-16) -27148*a(n-18) +249596*a(n-20) -142965*a(n-22) -601602*a(n-24) +1185157*a(n-26) -586527*a(n-28) -552103*a(n-30) +736485*a(n-32) -49406*a(n-34) -272061*a(n-36) +63499*a(n-38) +50155*a(n-40) -1001*a(n-42) -4198*a(n-44) -4416*a(n-46) -1042*a(n-48) -51*a(n-50) -100*a(n-52) -10*a(n-54) for n>59
%e A261379 Some solutions for n=4
%e A261379 ..1..0..1..0..1..0..1..0..1....0..1..0..1..0..1..0..0..0
%e A261379 ..0..1..0..1..0..1..0..0..0....1..0..0..0..1..0..1..0..1
%e A261379 ..1..0..0..0..1..0..1..0..1....0..1..0..1..0..1..0..1..0
%e A261379 ..0..1..0..1..0..1..0..1..0....1..0..1..0..1..0..1..0..1
%e A261379 ..1..0..1..0..1..0..1..0..0....0..1..0..1..0..1..0..1..0
%e A261379 ..0..0..0..1..0..0..0..1..0....1..0..0..0..1..0..0..0..1
%Y A261379 Cf. A261380.
%K A261379 nonn
%O A261379 1,1
%A A261379 _R. H. Hardin_, Aug 17 2015