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.

A302678 Number of nX6 0..1 arrays with every element equal to 0, 1, 4 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

This page as a plain text file.
%I A302678 #4 Apr 11 2018 12:27:01
%S A302678 13,13,40,76,187,453,1125,2782,6843,16908,41758,103027,254329,627855,
%T A302678 1549720,3825349,9442726,23308474,57535003,142020909,350567119,
%U A302678 865346622,2136039825,5272643974,13015100410,32126739133,79302295311,195751392919
%N A302678 Number of nX6 0..1 arrays with every element equal to 0, 1, 4 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.
%C A302678 Column 6 of A302680.
%H A302678 R. H. Hardin, <a href="/A302678/b302678.txt">Table of n, a(n) for n = 1..210</a>
%F A302678 Empirical: a(n) = a(n-1) +2*a(n-2) +4*a(n-3) +a(n-4) -2*a(n-5) -a(n-6) for n>12
%e A302678 Some solutions for n=5
%e A302678 ..0..1..0..1..0..1. .0..0..0..1..0..1. .0..1..0..1..0..1. .0..1..0..1..0..1
%e A302678 ..0..1..0..1..1..1. .0..1..0..1..1..1. .0..0..0..1..0..1. .0..1..0..0..0..1
%e A302678 ..0..1..0..1..0..1. .0..1..0..1..0..1. .0..1..0..1..0..1. .0..1..0..1..0..1
%e A302678 ..0..1..0..1..0..1. .0..1..0..1..0..1. .0..1..0..1..0..1. .0..1..1..1..0..1
%e A302678 ..0..0..0..1..0..1. .0..0..0..1..1..1. .0..1..1..1..0..1. .0..1..0..1..0..1
%Y A302678 Cf. A302680.
%K A302678 nonn
%O A302678 1,1
%A A302678 _R. H. Hardin_, Apr 11 2018