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.

A297655 Number of 2Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1, 2 or 3 neighboring 1s.

This page as a plain text file.
%I A297655 #4 Jan 02 2018 15:15:23
%S A297655 1,10,43,140,494,1845,6757,24479,89068,324765,1182996,4307440,
%T A297655 15687513,57137761,208098949,757896766,2760293603,10053139616,
%U A297655 36613986582,133349718469,485665707449,1768816633099,6442109942616,23462454583677
%N A297655 Number of 2Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1, 2 or 3 neighboring 1s.
%C A297655 Row 2 of A297654.
%H A297655 R. H. Hardin, <a href="/A297655/b297655.txt">Table of n, a(n) for n = 1..210</a>
%F A297655 Empirical: a(n) = 3*a(n-1) -2*a(n-2) +13*a(n-3) +6*a(n-4) +12*a(n-5) +12*a(n-6)
%e A297655 Some solutions for n=7
%e A297655 ..1..1..1..0..1..1..0. .0..1..1..0..0..1..1. .0..1..1..0..1..1..1
%e A297655 ..0..0..0..1..0..0..1. .1..0..0..1..0..0..1. .1..0..0..1..1..1..0
%Y A297655 Cf. A297654.
%K A297655 nonn
%O A297655 1,2
%A A297655 _R. H. Hardin_, Jan 02 2018