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.

A207848 Number of 5 X n 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 0 and 1 1 1 vertically.

This page as a plain text file.
%I A207848 #9 Jun 26 2018 05:41:40
%S A207848 16,256,704,2816,10144,38208,140032,524480,1928000,7206080,26535520,
%T A207848 99030016,365153536,1361114752,5024242112,18709799552,69123162272,
%U A207848 257205919680,950917193216,3536088581440,13080799664192,48617201294144
%N A207848 Number of 5 X n 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 0 and 1 1 1 vertically.
%C A207848 Row 5 of A207845.
%H A207848 R. H. Hardin, <a href="/A207848/b207848.txt">Table of n, a(n) for n = 1..210</a>
%F A207848 Empirical: a(n) = 15*a(n-2) + 4*a(n-3) - 32*a(n-4) - 4*a(n-5) + 15*a(n-6) - a(n-8) for n>9.
%F A207848 Empirical g.f.: 16*x*(1 + 16*x + 29*x^2 - 68*x^3 - 58*x^4 + 88*x^5 - 5*x^6 - 8*x^7 + x^8) / (1 - 15*x^2 - 4*x^3 + 32*x^4 + 4*x^5 - 15*x^6 + x^8). - _Colin Barker_, Jun 26 2018
%e A207848 Some solutions for n=4:
%e A207848 ..0..1..0..0....0..1..1..1....0..1..0..1....1..0..1..0....1..1..0..0
%e A207848 ..1..1..0..1....1..0..1..1....0..1..0..1....1..1..0..1....1..0..1..1
%e A207848 ..1..0..1..0....0..1..0..0....1..0..1..0....0..1..1..1....0..1..1..0
%e A207848 ..0..1..0..1....1..1..1..0....1..0..1..1....1..0..1..0....0..1..0..0
%e A207848 ..0..1..1..0....1..0..1..1....0..1..0..0....1..1..0..1....1..0..1..1
%Y A207848 Cf. A207845.
%K A207848 nonn
%O A207848 1,1
%A A207848 _R. H. Hardin_, Feb 21 2012