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.

A302955 Number of 4Xn 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 A302955 #4 Apr 16 2018 11:42:34
%S A302955 0,34,587,6531,87901,1248691,17374552,240722070,3341034465,
%T A302955 46388257442,643972648584,8939498283852,124098004402538,
%U A302955 1722731575686989,23914973741837431,331987784574422416,4608656564514739063
%N A302955 Number of 4Xn 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 A302955 Row 4 of A302953.
%H A302955 R. H. Hardin, <a href="/A302955/b302955.txt">Table of n, a(n) for n = 1..210</a>
%F A302955 Empirical: a(n) = 7*a(n-1) +64*a(n-2) +323*a(n-3) +1423*a(n-4) +2602*a(n-5) -1745*a(n-6) -17308*a(n-7) -49332*a(n-8) -76942*a(n-9) -37653*a(n-10) +24133*a(n-11) +51188*a(n-12) +90867*a(n-13) +48713*a(n-14) -32390*a(n-15) -35672*a(n-16) -23781*a(n-17) +15831*a(n-18) +22745*a(n-19) -4476*a(n-20) -2492*a(n-21) -8*a(n-22) -1296*a(n-23) +576*a(n-24) for n>25
%e A302955 Some solutions for n=5
%e A302955 ..0..0..0..1..0. .0..1..1..0..0. .0..0..0..1..1. .0..0..1..1..0
%e A302955 ..1..1..1..0..0. .0..0..0..1..0. .1..0..1..1..1. .1..0..1..0..1
%e A302955 ..1..0..0..0..1. .0..0..0..0..1. .1..1..0..0..0. .0..1..0..0..1
%e A302955 ..0..0..0..1..0. .0..1..1..1..1. .1..0..1..0..0. .1..0..0..1..0
%Y A302955 Cf. A302953.
%K A302955 nonn
%O A302955 1,2
%A A302955 _R. H. Hardin_, Apr 16 2018