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.

A267915 Number of 4Xn 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 A267915 #4 Jan 22 2016 08:03:59
%S A267915 13,938,43972,2331981,104491831,4817531571,207508204575,8960112001163,
%T A267915 375426257575299,15673406360156331,644971612069289479,
%U A267915 26434347183210422659,1075438596218448452443,43616300555346348016639
%N A267915 Number of 4Xn 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 A267915 Row 4 of A267911.
%H A267915 R. H. Hardin, <a href="/A267915/b267915.txt">Table of n, a(n) for n = 1..151</a>
%e A267915 Some solutions for n=3
%e A267915 ..0..0..1....0..1..0....0..0..1....0..1..0....0..1..0....0..1..2....0..1..2
%e A267915 ..1..2..0....0..2..0....2..1..2....0..0..1....0..2..0....2..2..1....2..0..0
%e A267915 ..0..2..2....1..1..0....0..2..1....2..0..2....0..0..2....0..1..2....1..0..0
%e A267915 ..0..1..0....2..2..1....0..1..2....1..0..2....2..1..1....0..1..0....2..1..1
%Y A267915 Cf. A267911.
%K A267915 nonn
%O A267915 1,1
%A A267915 _R. H. Hardin_, Jan 22 2016