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.

A267914 Number of 3Xn 0..2 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 A267914 #4 Jan 22 2016 08:03:03
%S A267914 5,122,2304,47916,878004,16435188,292341636,5209312500,90756319716,
%T A267914 1576811812500,27101734404228,464405881704372,7914055449851172,
%U A267914 134550496512585684,2280733479912724164,38598223339253538036
%N A267914 Number of 3Xn 0..2 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 A267914 Row 3 of A267911.
%H A267914 R. H. Hardin, <a href="/A267914/b267914.txt">Table of n, a(n) for n = 1..210</a>
%F A267914 Empirical: a(n) = 31*a(n-1) -26*a(n-2) -6768*a(n-3) +39456*a(n-4) +479232*a(n-5) -3704832*a(n-6) -12386304*a(n-7) +115867648*a(n-8) +83886080*a(n-9) -1073741824*a(n-10) for n>12
%e A267914 Some solutions for n=4
%e A267914 ..0..1..2..2....0..0..1..1....0..1..2..1....0..1..0..2....0..0..1..2
%e A267914 ..2..0..2..2....0..2..1..0....2..0..0..2....1..1..2..2....2..2..0..0
%e A267914 ..0..0..1..1....0..0..2..0....2..2..0..0....1..2..2..1....2..1..2..1
%Y A267914 Cf. A267911.
%K A267914 nonn
%O A267914 1,1
%A A267914 _R. H. Hardin_, Jan 22 2016