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.

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

This page as a plain text file.
%I A207406 #7 Jul 22 2025 20:23:00
%S A207406 12,144,636,2809,8692,26896,68060,172225,380970,842724,1690038,
%T A207406 3389281,6303584,11723776,20533728,35964009,59970000,100000000,
%U A207406 160050000,256160025,395963700,612067600,918225100,1377523225,2013488750
%N A207406 Number of 6Xn 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 0 1 and 1 1 0 vertically.
%C A207406 Row 6 of A207403
%H A207406 R. H. Hardin, <a href="/A207406/b207406.txt">Table of n, a(n) for n = 1..210</a>
%F A207406 Empirical: a(n) = 2*a(n-1) +10*a(n-2) -22*a(n-3) -44*a(n-4) +110*a(n-5) +110*a(n-6) -330*a(n-7) -165*a(n-8) +660*a(n-9) +132*a(n-10) -924*a(n-11) +924*a(n-13) -132*a(n-14) -660*a(n-15) +165*a(n-16) +330*a(n-17) -110*a(n-18) -110*a(n-19) +44*a(n-20) +22*a(n-21) -10*a(n-22) -2*a(n-23) +a(n-24)
%e A207406 Some solutions for n=4
%e A207406 ..0..1..0..1....1..0..0..0....1..1..1..1....0..0..0..0....1..0..0..0
%e A207406 ..0..1..0..0....0..0..0..0....1..1..1..1....1..1..0..0....0..1..0..1
%e A207406 ..0..1..0..0....0..0..0..0....1..1..1..1....0..0..0..0....0..1..0..0
%e A207406 ..0..1..0..0....0..0..0..0....1..1..1..1....1..0..0..0....0..1..0..1
%e A207406 ..0..1..0..0....0..0..0..0....1..1..1..1....0..0..0..0....0..1..0..1
%e A207406 ..0..1..0..0....0..0..0..0....1..1..1..1....1..0..0..0....0..1..0..1
%K A207406 nonn
%O A207406 1,1
%A A207406 _R. H. Hardin_ Feb 17 2012