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.

A267930 Number of nX3 0..3 arrays with every repeated value in every row and column greater than the previous repeated value.

This page as a plain text file.
%I A267930 #4 Jan 22 2016 10:07:53
%S A267930 60,3600,178068,8459154,376812420,16109362560,663451196118,
%T A267930 26507885328672,1031599522028772,39244717326244854,
%U A267930 1463429227285701348,53613261264275522982,1933276790525967340428,68725772580648925008792
%N A267930 Number of nX3 0..3 arrays with every repeated value in every row and column greater than the previous repeated value.
%C A267930 Column 3 of A267933.
%H A267930 R. H. Hardin, <a href="/A267930/b267930.txt">Table of n, a(n) for n = 1..210</a>
%H A267930 R. H. Hardin, <a href="/A267930/a267930.txt">Empirical recurrence of order 81</a>
%F A267930 Empirical recurrence of order 81 (see link above)
%e A267930 Some solutions for n=3
%e A267930 ..2..3..3....2..2..3....0..1..3....0..1..1....1..0..0....1..2..2....0..1..2
%e A267930 ..1..0..2....0..1..3....2..1..3....2..0..0....3..0..1....3..2..1....1..2..2
%e A267930 ..3..1..1....0..2..0....0..0..2....2..2..1....2..2..0....3..0..0....2..2..1
%Y A267930 Cf. A267933.
%K A267930 nonn
%O A267930 1,1
%A A267930 _R. H. Hardin_, Jan 22 2016