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.

A207925 Number of nX5 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 0 and 1 1 1 vertically.

This page as a plain text file.
%I A207925 #7 Jul 22 2025 21:00:32
%S A207925 15,225,360,1872,7744,29760,126688,520608,2103000,8741840,35823024,
%T A207925 146214208,604202544,2474564288,10137402552,41768664000,171129168720,
%U A207925 702148157568,2888077723232,11839454522224,48607631557944
%N A207925 Number of nX5 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 0 and 1 1 1 vertically.
%C A207925 Column 5 of A207928
%H A207925 R. H. Hardin, <a href="/A207925/b207925.txt">Table of n, a(n) for n = 1..210</a>
%F A207925 Empirical: a(n) = 3*a(n-2) +63*a(n-3) +12*a(n-4) +21*a(n-5) -749*a(n-6) +34*a(n-7) -343*a(n-8) +3571*a(n-9) -666*a(n-10) +1227*a(n-11) -7816*a(n-12) +1430*a(n-13) -1022*a(n-14) +7504*a(n-15) -771*a(n-16) +78*a(n-17) -3329*a(n-18) +37*a(n-19) +100*a(n-20) +661*a(n-21) +35*a(n-22) -2*a(n-23) -45*a(n-24) -a(n-25) +a(n-27) for n>29
%e A207925 Some solutions for n=6
%e A207925 ..1..0..1..1..0....0..0..1..1..0....0..1..1..1..1....1..1..0..0..1
%e A207925 ..1..1..0..1..1....1..1..0..0..1....1..1..1..0..0....0..0..1..1..1
%e A207925 ..0..1..1..0..1....1..0..1..1..1....1..0..0..1..1....0..1..1..0..0
%e A207925 ..1..0..1..1..0....0..1..1..1..0....0..0..1..1..1....1..0..0..1..1
%e A207925 ..1..1..0..0..1....1..1..0..0..1....0..1..1..0..0....0..0..1..1..1
%e A207925 ..0..0..1..1..1....0..0..1..1..0....1..0..0..1..1....1..1..1..0..0
%K A207925 nonn
%O A207925 1,1
%A A207925 _R. H. Hardin_ Feb 21 2012