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.

A267725 Number of 2Xn arrays containing n copies of 0..2-1 with every element equal to at least one horizontal neighbor and the top left element equal to 0.

This page as a plain text file.
%I A267725 #6 Aug 12 2016 06:54:16
%S A267725 0,1,1,3,5,12,26,60,143,353,879,2200,5528,13963,35421,90122,229729,
%T A267725 586438,1498966,3836099,9827905,25202549,64683193,166137751,427022480,
%U A267725 1098291533,2826500851,7278246356,18751418071,48334451894,124647030884
%N A267725 Number of 2Xn arrays containing n copies of 0..2-1 with every element equal to at least one horizontal neighbor and the top left element equal to 0.
%C A267725 Row 2 of A267724.
%H A267725 R. H. Hardin, <a href="/A267725/b267725.txt">Table of n, a(n) for n = 1..210</a>
%e A267725 Some solutions for n=6
%e A267725 ..0..0..1..1..0..0....0..0..1..1..1..1....0..0..1..1..0..0....0..0..0..0..0..0
%e A267725 ..0..0..1..1..1..1....0..0..0..0..1..1....1..1..1..1..0..0....1..1..1..1..1..1
%Y A267725 Cf. A267724.
%K A267725 nonn
%O A267725 1,4
%A A267725 _R. H. Hardin_, Jan 20 2016