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.

A208712 Number of 5Xn 0..1 arrays with new values 0..1 introduced in row major order and no element equal to more than two of its immediate leftward or upward or right-upward antidiagonal neighbors.

This page as a plain text file.
%I A208712 #7 Jul 22 2025 21:29:27
%S A208712 16,512,9604,204020,4226368,87985748,1830045552,38070302740,
%T A208712 791949216708,16474443378336,342707611610988,7129134738677660,
%U A208712 148302981848252912,3085055246536395480,64176496980568384684,1335023990202619369508
%N A208712 Number of 5Xn 0..1 arrays with new values 0..1 introduced in row major order and no element equal to more than two of its immediate leftward or upward or right-upward antidiagonal neighbors.
%C A208712 Row 5 of A208709
%H A208712 R. H. Hardin, <a href="/A208712/b208712.txt">Table of n, a(n) for n = 1..210</a>
%F A208712 Empirical: a(n) = 17*a(n-1) +95*a(n-2) -269*a(n-3) -1372*a(n-4) +1500*a(n-5) +6585*a(n-6) -5267*a(n-7) -11175*a(n-8) +10357*a(n-9) +1757*a(n-10) -3001*a(n-11) +237*a(n-12) +207*a(n-13) -30*a(n-14) for n>17
%e A208712 Some solutions for n=4
%e A208712 ..0..0..1..0....0..0..1..1....0..1..0..0....0..0..1..0....0..0..1..0
%e A208712 ..0..0..1..1....0..1..0..0....1..1..1..0....0..1..1..1....1..1..1..1
%e A208712 ..1..0..0..0....0..1..1..1....1..0..1..1....1..0..1..1....0..1..0..1
%e A208712 ..0..1..0..1....1..0..0..1....0..1..0..1....1..1..0..1....0..1..0..0
%e A208712 ..0..0..1..0....0..1..1..0....0..0..1..1....1..1..0..1....0..1..1..0
%K A208712 nonn
%O A208712 1,1
%A A208712 _R. H. Hardin_ Mar 01 2012