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.

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

This page as a plain text file.
%I A303317 #4 Apr 21 2018 12:50:38
%S A303317 16,9,19,74,139,410,1799,5907,16494,53290,184915,593160,1846238,
%T A303317 5986532,19644799,63120477,201894029,652765881,2113653016,6806905917,
%U A303317 21913260238,70736938785,228339832475,736091706666,2373144545904,7656031069031
%N A303317 Number of 5Xn 0..1 arrays with every element equal to 0, 1, 4, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.
%C A303317 Row 5 of A303314.
%H A303317 R. H. Hardin, <a href="/A303317/b303317.txt">Table of n, a(n) for n = 1..210</a>
%F A303317 Empirical: a(n) = 2*a(n-1) -a(n-2) +11*a(n-3) +21*a(n-4) -13*a(n-5) +5*a(n-6) -37*a(n-7) -34*a(n-8) +4*a(n-9) -20*a(n-10) +18*a(n-11) -7*a(n-12) for n>16
%e A303317 Some solutions for n=5
%e A303317 ..0..1..0..1..0. .0..0..0..1..0. .0..1..0..1..0. .0..0..0..1..0
%e A303317 ..0..0..0..1..0. .0..1..0..1..0. .0..1..1..1..0. .0..1..0..1..0
%e A303317 ..0..1..1..1..0. .0..1..0..1..0. .0..1..0..1..0. .0..1..0..1..0
%e A303317 ..0..1..0..0..0. .0..0..0..1..0. .0..1..0..0..0. .0..1..0..0..0
%e A303317 ..0..1..0..1..1. .0..1..0..1..0. .0..1..0..1..0. .0..1..0..1..0
%Y A303317 Cf. A303314.
%K A303317 nonn
%O A303317 1,1
%A A303317 _R. H. Hardin_, Apr 21 2018