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.

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

This page as a plain text file.
%I A208025 #7 Jul 22 2025 21:07:03
%S A208025 16,256,1260,5895,26845,123709,574560,2652823,12235080,56562528,
%T A208025 261375285,1207084221,5576420791,25763656492,119015522955,
%U A208025 549803070176,2539953311868,11733758509383,54205846730505,250413745670973
%N A208025 Number of nX5 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 0 and 1 0 1 vertically.
%C A208025 Column 5 of A208028
%H A208025 R. H. Hardin, <a href="/A208025/b208025.txt">Table of n, a(n) for n = 1..210</a>
%F A208025 Empirical: a(n) = a(n-1) +3*a(n-2) +46*a(n-3) +80*a(n-4) +85*a(n-5) -209*a(n-6) -717*a(n-7) -782*a(n-8) +822*a(n-9) +3069*a(n-10) +1453*a(n-11) -3393*a(n-12) -3921*a(n-13) -204*a(n-14) +3302*a(n-15) +2760*a(n-16) -110*a(n-17) -883*a(n-18) -1470*a(n-19) -1242*a(n-20) +710*a(n-21) -507*a(n-22) +1675*a(n-23) -849*a(n-24) +968*a(n-25) -885*a(n-26) +238*a(n-27) -485*a(n-28) +90*a(n-29) -101*a(n-30) +63*a(n-31) -7*a(n-32) +14*a(n-33) -3*a(n-34) -a(n-36) for n>37
%e A208025 Some solutions for n=4
%e A208025 ..1..1..1..1..1....1..1..1..1..1....0..1..1..0..1....1..0..1..1..1
%e A208025 ..0..1..1..1..1....0..1..1..1..1....1..1..0..1..1....0..1..0..1..1
%e A208025 ..0..1..0..1..0....0..1..1..1..1....1..1..0..1..1....0..1..0..1..0
%e A208025 ..1..1..0..1..0....1..1..1..1..0....0..1..1..1..1....1..0..1..1..0
%K A208025 nonn
%O A208025 1,1
%A A208025 _R. H. Hardin_ Feb 22 2012