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.

A209653 Number of 6Xn 0..1 arrays avoiding 0 0 1 and 1 0 0 horizontally and 0 0 1 and 1 0 1 vertically.

This page as a plain text file.
%I A209653 #7 Jul 22 2025 21:53:09
%S A209653 12,144,636,2079,8904,34012,145775,597856,2579940,10954895,47622744,
%T A209653 205998660,901433351,3942155568,17346881260,76402898495,337745931240,
%U A209653 1495044223756,6633766629567,29474645542848,131183330978644
%N A209653 Number of 6Xn 0..1 arrays avoiding 0 0 1 and 1 0 0 horizontally and 0 0 1 and 1 0 1 vertically.
%C A209653 Row 6 of A209650
%H A209653 R. H. Hardin, <a href="/A209653/b209653.txt">Table of n, a(n) for n = 1..210</a>
%F A209653 Empirical: a(n) = 13*a(n-1) -15*a(n-2) -453*a(n-3) +1521*a(n-4) +6613*a(n-5) -32909*a(n-6) -51675*a(n-7) +380097*a(n-8) +219811*a(n-9) -2799167*a(n-10) -347187*a(n-11) +14122641*a(n-12) -1318649*a(n-13) -50390909*a(n-14) +9520521*a(n-15) +128386635*a(n-16) -28476569*a(n-17) -232248311*a(n-18) +53023599*a(n-19) +292800435*a(n-20) -67701287*a(n-21) -248742653*a(n-22) +60344055*a(n-23) +134128372*a(n-24) -35691432*a(n-25) -40789736*a(n-26) +12200640*a(n-27) +5184000*a(n-28) -1728000*a(n-29) for n>30
%e A209653 Some solutions for n=4
%e A209653 ..0..0..0..0....0..1..0..1....0..0..0..0....1..0..1..1....1..0..1..1
%e A209653 ..0..1..0..1....1..0..1..1....0..1..0..1....0..0..0..0....0..1..1..0
%e A209653 ..0..1..0..1....1..0..1..1....0..1..0..1....0..0..0..0....0..1..1..0
%e A209653 ..0..1..0..1....1..0..1..0....0..1..0..1....0..0..0..0....0..1..1..0
%e A209653 ..0..1..0..1....0..0..0..0....0..0..0..0....0..0..0..0....0..0..0..0
%e A209653 ..0..1..0..1....0..0..0..0....0..0..0..0....0..0..0..0....0..0..0..0
%K A209653 nonn
%O A209653 1,1
%A A209653 _R. H. Hardin_ Mar 11 2012