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.

A267668 Number of 3Xn 0..1 arrays with every repeated value in every row unequal to the previous repeated value, and in every column equal to the previous repeated value, and new values introduced in row-major sequential order.

This page as a plain text file.
%I A267668 #4 Jan 19 2016 08:09:37
%S A267668 4,32,108,500,1372,5324,13500,48668,119164,415292,1000188,3429500,
%T A267668 8193532,27871484,66325500,224727548,533731324,1804870652,4282396668,
%U A267668 14467221500,34309431292,115850907644,274676629500,927260024828
%N A267668 Number of 3Xn 0..1 arrays with every repeated value in every row unequal to the previous repeated value, and in every column equal to the previous repeated value, and new values introduced in row-major sequential order.
%C A267668 Row 3 of A267667.
%H A267668 R. H. Hardin, <a href="/A267668/b267668.txt">Table of n, a(n) for n = 1..210</a>
%F A267668 Empirical: a(n) = a(n-1) +14*a(n-2) -14*a(n-3) -56*a(n-4) +56*a(n-5) +64*a(n-6) -64*a(n-7)
%e A267668 Some solutions for n=8
%e A267668 ..0..1..0..1..0..1..0..1....0..1..0..1..0..0..1..1....0..1..0..1..0..1..0..1
%e A267668 ..1..0..1..0..1..0..1..1....0..0..1..0..1..1..0..1....0..0..1..0..1..0..1..1
%e A267668 ..1..1..0..1..0..0..1..0....1..0..1..0..1..1..0..1....1..0..1..1..0..0..1..0
%Y A267668 Cf. A267667.
%K A267668 nonn
%O A267668 1,1
%A A267668 _R. H. Hardin_, Jan 19 2016