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.

A267963 Number of nX4 0..2 arrays with every repeated value in every row and column greater than the previous repeated value.

This page as a plain text file.
%I A267963 #4 Jan 22 2016 14:29:11
%S A267963 63,3969,157182,5843562,185900905,5520230601,151596664089,
%T A267963 3948855568663,97889332200024,2332332672746881,53631396879772976,
%U A267963 1196249503631460096,25965520951599991001,550166212967293315266,11406213718800127365141
%N A267963 Number of nX4 0..2 arrays with every repeated value in every row and column greater than the previous repeated value.
%C A267963 Column 4 of A267966.
%H A267963 R. H. Hardin, <a href="/A267963/b267963.txt">Table of n, a(n) for n = 1..186</a>
%e A267963 Some solutions for n=3
%e A267963 ..2..0..2..1....0..0..2..0....2..0..2..0....2..0..1..2....0..1..0..1
%e A267963 ..2..2..1..0....0..0..1..2....0..2..1..2....1..1..2..1....0..2..2..1
%e A267963 ..1..2..0..1....1..2..0..1....2..0..2..0....0..0..1..2....2..2..1..0
%Y A267963 Cf. A267966.
%K A267963 nonn
%O A267963 1,1
%A A267963 _R. H. Hardin_, Jan 22 2016