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.

A240778 Number of n X 3 0..1 arrays with no element equal to fewer vertical neighbors than horizontal neighbors, with new values 0..1 introduced in row major order.

This page as a plain text file.
%I A240778 #7 Oct 29 2018 05:59:23
%S A240778 1,4,20,97,459,2187,10442,49861,238068,1136678,5427201,25912833,
%T A240778 123723975,590735140,2820536641,13466994652,64299801122,307007207679,
%U A240778 1465843189533,6998846289463,33416841401200,159552766705917
%N A240778 Number of n X 3 0..1 arrays with no element equal to fewer vertical neighbors than horizontal neighbors, with new values 0..1 introduced in row major order.
%H A240778 R. H. Hardin, <a href="/A240778/b240778.txt">Table of n, a(n) for n = 1..210</a>
%F A240778 Empirical: a(n) = 5*a(n-1) - a(n-2) - a(n-3) + 4*a(n-4) - 4*a(n-5) - 3*a(n-6) + a(n-7).
%F A240778 Empirical g.f.: x*(1 + x)^2*(1 - 3*x + 6*x^2 - 7*x^3 + 2*x^4) / ((1 - x)*(1 - 4*x - 3*x^2 - 2*x^3 - 6*x^4 - 2*x^5 + x^6)). - _Colin Barker_, Oct 29 2018
%e A240778 Some solutions for n=4:
%e A240778 ..0..1..0....0..1..0....0..1..0....0..1..0....0..1..0....0..1..0....0..1..0
%e A240778 ..0..1..1....1..0..1....0..1..0....0..1..0....0..1..0....1..0..1....1..1..0
%e A240778 ..0..1..1....0..1..1....1..0..1....1..1..0....0..0..1....1..1..0....1..0..0
%e A240778 ..0..1..0....0..1..0....0..1..0....1..1..0....1..0..1....0..1..0....1..0..0
%Y A240778 Column 3 of A240783.
%K A240778 nonn
%O A240778 1,2
%A A240778 _R. H. Hardin_, Apr 12 2014