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.

A267631 Number of 5Xn arrays containing n copies of 0..5-1 with every element equal to or 1 greater than any west neighbor modulo 5 and the upper left element equal to 0.

This page as a plain text file.
%I A267631 #5 Aug 12 2016 06:54:15
%S A267631 24,138,1576,29387,679735,17761798,490407156,13531702872,364823204989,
%T A267631 9669161777304
%N A267631 Number of 5Xn arrays containing n copies of 0..5-1 with every element equal to or 1 greater than any west neighbor modulo 5 and the upper left element equal to 0.
%C A267631 Row 5 of A267629.
%e A267631 Some solutions for n=4
%e A267631 ..0..0..1..1....0..1..1..2....0..1..2..3....0..1..2..3....0..0..1..1
%e A267631 ..4..0..1..1....1..2..3..4....0..1..1..2....4..4..0..0....2..2..2..3
%e A267631 ..2..2..3..4....2..3..4..4....4..4..0..1....1..2..3..4....4..0..0..1
%e A267631 ..2..3..4..0....0..0..1..2....2..3..3..4....2..3..3..4....3..4..4..4
%e A267631 ..2..3..3..4....3..3..4..0....2..3..4..0....0..1..1..2....1..2..3..3
%Y A267631 Cf. A267629.
%K A267631 nonn
%O A267631 1,1
%A A267631 _R. H. Hardin_, Jan 18 2016

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.