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.

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

This page as a plain text file.
%I A302168 #4 Apr 02 2018 14:52:55
%S A302168 32,42,57,156,280,635,1247,2815,5524,12457,25230,55645,113410,249611,
%T A302168 517232,1123390,2334467,5059272,10608909,22830143,47940869,102999865,
%U A302168 217358333,465280120,982600249,2101097147,4449151154,9495603067
%N A302168 Number of 6Xn 0..1 arrays with every element equal to 0, 1 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.
%C A302168 Row 6 of A302163.
%H A302168 R. H. Hardin, <a href="/A302168/b302168.txt">Table of n, a(n) for n = 1..210</a>
%F A302168 Empirical: a(n) = a(n-1) +2*a(n-2) -a(n-3) +20*a(n-4) -16*a(n-5) -37*a(n-6) +15*a(n-7) -129*a(n-8) +82*a(n-9) +223*a(n-10) -69*a(n-11) +417*a(n-12) -193*a(n-13) -636*a(n-14) +100*a(n-15) -762*a(n-16) +265*a(n-17) +957*a(n-18) +8*a(n-19) +818*a(n-20) -220*a(n-21) -784*a(n-22) -149*a(n-23) -528*a(n-24) +97*a(n-25) +358*a(n-26) +138*a(n-27) +187*a(n-28) -18*a(n-29) -91*a(n-30) -46*a(n-31) -22*a(n-32) +2*a(n-33) +8*a(n-34) +4*a(n-35) for n>45
%e A302168 Some solutions for n=5
%e A302168 ..0..1..1..0..1. .0..0..1..1..0. .0..1..0..1..0. .0..0..1..1..0
%e A302168 ..1..0..1..0..0. .0..1..0..1..0. .1..1..0..1..0. .0..1..0..1..0
%e A302168 ..1..0..1..0..1. .0..1..0..1..0. .0..1..0..0..1. .0..1..0..1..0
%e A302168 ..1..0..1..0..1. .0..1..0..1..0. .1..0..1..0..1. .0..1..0..1..0
%e A302168 ..1..0..1..0..0. .1..1..0..1..0. .0..0..1..0..1. .0..1..0..1..0
%e A302168 ..1..0..1..0..1. .0..1..0..1..0. .1..0..1..1..0. .0..1..1..0..0
%Y A302168 Cf. A302163.
%K A302168 nonn
%O A302168 1,1
%A A302168 _R. H. Hardin_, Apr 02 2018