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.

A267284 Number of 4Xn arrays containing n copies of 0..4-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo 4 and the upper left element equal to 0.

This page as a plain text file.
%I A267284 #6 Aug 12 2016 06:54:00
%S A267284 6,5,24,137,1138,12214,104742,741057,5022782,35540696,271621650,
%T A267284 2252475421,19535278570,168510129798,1410939522686,11518135263919,
%U A267284 93278847927814,762132469855714,6339718207407286,53641859402324039
%N A267284 Number of 4Xn arrays containing n copies of 0..4-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo 4 and the upper left element equal to 0.
%C A267284 Row 4 of A267278.
%H A267284 R. H. Hardin, <a href="/A267284/b267284.txt">Table of n, a(n) for n = 1..24</a>
%e A267284 Some solutions for n=4
%e A267284 ..0..3..1..1....0..2..0..3....0..2..0..3....0..2..1..0....0..3..2..1
%e A267284 ..2..1..0..2....2..0..3..1....2..0..3..1....2..0..3..2....3..1..0..2
%e A267284 ..0..3..2..0....0..2..1..3....3..2..1..3....0..3..1..3....0..3..2..1
%e A267284 ..3..1..3..2....1..1..3..2....1..0..2..1....2..1..3..1....2..1..0..3
%Y A267284 Cf. A267278.
%K A267284 nonn
%O A267284 1,1
%A A267284 _R. H. Hardin_, Jan 12 2016