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.

A302949 Number of nX4 0..1 arrays with every element equal to 1, 2, 3, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

This page as a plain text file.
%I A302949 #4 Apr 16 2018 11:38:28
%S A302949 2,46,519,6531,80589,998670,12365841,153141597,1896492042,23486107930,
%T A302949 290851104799,3601890066510,44605681284501,552395208564836,
%U A302949 6840843079654058,84716763151740480,1049129453065059314
%N A302949 Number of nX4 0..1 arrays with every element equal to 1, 2, 3, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.
%C A302949 Column 4 of A302953.
%H A302949 R. H. Hardin, <a href="/A302949/b302949.txt">Table of n, a(n) for n = 1..210</a>
%F A302949 Empirical: a(n) = 9*a(n-1) +41*a(n-2) +29*a(n-3) -181*a(n-4) -466*a(n-5) -225*a(n-6) +66*a(n-7) +298*a(n-8) -52*a(n-9) +57*a(n-10) -10*a(n-11) -25*a(n-12) +4*a(n-13)
%e A302949 Some solutions for n=5
%e A302949 ..0..0..0..1. .0..0..1..0. .0..1..0..0. .0..1..0..1. .0..0..0..0
%e A302949 ..0..0..1..1. .1..1..0..0. .1..0..0..0. .0..0..1..0. .1..0..1..0
%e A302949 ..0..0..0..1. .1..0..0..1. .0..1..0..0. .0..1..0..0. .0..1..0..1
%e A302949 ..0..0..1..0. .1..0..1..0. .0..0..0..1. .0..1..0..0. .0..0..1..1
%e A302949 ..1..1..0..0. .0..1..0..1. .1..1..1..0. .1..0..1..0. .1..1..1..1
%Y A302949 Cf. A302953.
%K A302949 nonn
%O A302949 1,1
%A A302949 _R. H. Hardin_, Apr 16 2018