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.

A267907 Number of nX3 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 A267907 #4 Jan 22 2016 07:57:15
%S A267907 4,96,2304,43972,754852,12017350,181535822,2638824216,37263580006,
%T A267907 514648921140,6985835894832,93540620739538,1238999184320608,
%U A267907 16269402566811754,212148448282604414,2750808905345217294
%N A267907 Number of nX3 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 A267907 Column 3 of A267911.
%H A267907 R. H. Hardin, <a href="/A267907/b267907.txt">Table of n, a(n) for n = 1..210</a>
%H A267907 R. H. Hardin, <a href="/A267907/a267907.txt">Empirical recurrence of order 54</a>
%F A267907 Empirical recurrence of order 54 (see link above)
%e A267907 Some solutions for n=4
%e A267907 ..0..1..1....0..0..1....0..1..2....0..1..1....0..0..1....0..1..2....0..1..2
%e A267907 ..2..2..1....2..1..1....2..1..2....1..0..0....0..0..1....1..0..0....0..1..1
%e A267907 ..1..0..2....2..1..0....1..0..2....2..0..1....0..1..1....1..2..0....0..0..2
%e A267907 ..2..0..1....0..2..1....2..1..0....0..0..2....0..0..2....2..1..0....0..2..2
%Y A267907 Cf. A267911.
%K A267907 nonn
%O A267907 1,1
%A A267907 _R. H. Hardin_, Jan 22 2016