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.

A219422 Unchanging value maps: number of 2 X n binary arrays indicating the locations of corresponding elements unequal to no horizontal or antidiagonal neighbor in a random 0..2 2 X n array.

This page as a plain text file.
%I A219422 #8 Jul 26 2018 05:17:07
%S A219422 1,7,20,57,160,454,1292,3676,10452,29724,84548,240480,683968,1945348,
%T A219422 5533040,15737260,44760324,127308564,362094824,1029880752,2929216636,
%U A219422 8331363064,23696305892,67397723860,191694568548,545223274608
%N A219422 Unchanging value maps: number of 2 X n binary arrays indicating the locations of corresponding elements unequal to no horizontal or antidiagonal neighbor in a random 0..2 2 X n array.
%C A219422 Row 2 of A219421.
%H A219422 R. H. Hardin, <a href="/A219422/b219422.txt">Table of n, a(n) for n = 1..210</a>
%F A219422 Empirical: a(n) = 2*a(n-1) + a(n-2) + 3*a(n-3) + 4*a(n-4) - 2*a(n-5) - 4*a(n-6) for n>8.
%F A219422 Empirical g.f.: x*(1 + 5*x + 5*x^2 + 7*x^3 + x^4 - 9*x^5 - 9*x^6 - 2*x^7) / ((1 + 2*x^2)*(1 - 2*x - 3*x^2 + x^3 + 2*x^4)). - _Colin Barker_, Jul 26 2018
%e A219422 Some solutions for n=3:
%e A219422 ..0..0..0....1..0..1....0..0..1....0..0..0....1..0..0....0..0..1....0..0..0
%e A219422 ..1..0..1....0..0..0....0..0..1....0..0..1....0..0..1....0..0..0....1..0..0
%Y A219422 Cf. A219421.
%K A219422 nonn
%O A219422 1,2
%A A219422 _R. H. Hardin_, Nov 19 2012