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.

A266574 Number of 4Xn arrays containing n copies of 0..4-1 with no element 1 greater than its northwest or southwest neighbor modulo 4 and the upper left element equal to 0.

This page as a plain text file.
%I A266574 #6 Aug 12 2016 06:53:59
%S A266574 6,74,2320,77830,2595190,94930586,3708826784,148879349035,
%T A266574 6098536482216,255081230000786,10848711502940592,467125765450160196,
%U A266574 20321101379722519804,892020118445773622883,39459836156094190716464
%N A266574 Number of 4Xn arrays containing n copies of 0..4-1 with no element 1 greater than its northwest or southwest neighbor modulo 4 and the upper left element equal to 0.
%C A266574 Row 4 of A266572.
%H A266574 R. H. Hardin, <a href="/A266574/b266574.txt">Table of n, a(n) for n = 1..16</a>
%e A266574 Some solutions for n=4
%e A266574 ..0..1..3..1....0..0..1..2....0..1..2..1....0..2..3..3....0..2..3..3
%e A266574 ..1..3..3..1....2..2..0..3....3..0..3..2....0..3..0..1....2..0..1..1
%e A266574 ..0..0..2..2....2..1..1..3....0..1..2..3....1..2..3..0....2..2..3..0
%e A266574 ..2..2..3..0....3..1..0..3....3..0..1..2....2..1..1..2....0..1..1..3
%Y A266574 Cf. A266572.
%K A266574 nonn
%O A266574 1,1
%A A266574 _R. H. Hardin_, Jan 01 2016