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.

A301838 Number of nX5 0..1 arrays with every element equal to 0, 1 or 2 horizontally or antidiagonally adjacent elements, with upper left element zero.

This page as a plain text file.
%I A301838 #4 Mar 27 2018 14:29:00
%S A301838 16,263,3182,39703,496085,6196305,77396422,966770632,12076215811,
%T A301838 150848052398,1884295439869,23537397007865,294013935342365,
%U A301838 3672631985528460,45876144707506920,573055146404781265
%N A301838 Number of nX5 0..1 arrays with every element equal to 0, 1 or 2 horizontally or antidiagonally adjacent elements, with upper left element zero.
%C A301838 Column 5 of A301841.
%H A301838 R. H. Hardin, <a href="/A301838/b301838.txt">Table of n, a(n) for n = 1..210</a>
%F A301838 Empirical: a(n) = 24*a(n-1) -201*a(n-2) +885*a(n-3) -2461*a(n-4) +4680*a(n-5) -6187*a(n-6) +5625*a(n-7) -3450*a(n-8) +1378*a(n-9) -324*a(n-10) +32*a(n-11) for n>13
%e A301838 Some solutions for n=5
%e A301838 ..0..0..1..0..0. .0..0..0..0..1. .0..0..0..1..1. .0..0..0..0..1
%e A301838 ..0..0..1..0..0. .1..1..0..0..1. .1..1..0..0..1. .1..1..1..0..0
%e A301838 ..0..0..1..0..1. .1..1..1..0..1. .1..0..1..0..0. .0..1..0..1..0
%e A301838 ..0..1..0..1..1. .0..1..1..0..0. .1..0..1..0..1. .1..1..0..1..1
%e A301838 ..1..1..0..1..1. .0..1..1..0..1. .0..1..0..0..1. .1..1..1..0..0
%Y A301838 Cf. A301841.
%K A301838 nonn
%O A301838 1,1
%A A301838 _R. H. Hardin_, Mar 27 2018