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.

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

This page as a plain text file.
%I A267753 #6 Aug 12 2016 06:54:16
%S A267753 1,11,313,13451,679735,37668275,2218059985,136270559675,8639673619975,
%T A267753 561345949073501,37199029884576055,2505536459782428275,
%U A267753 171083113958746029535,11818808909940579018035,824717389713663500108473
%N A267753 Number of 5Xn arrays containing n copies of 0..5-1 with every element equal to or 1 greater than any north neighbor modulo 5 and the upper left element equal to 0.
%C A267753 Row 5 of A267751.
%H A267753 R. H. Hardin, <a href="/A267753/b267753.txt">Table of n, a(n) for n = 1..16</a>
%e A267753 Some solutions for n=4
%e A267753 ..0..0..2..4....0..0..2..4....0..4..2..1....0..2..1..1....0..4..2..3
%e A267753 ..1..0..3..4....1..1..3..0....1..4..3..1....0..3..2..1....0..0..2..4
%e A267753 ..2..1..3..0....1..2..4..0....1..0..3..2....1..4..3..2....1..1..3..4
%e A267753 ..2..2..4..1....2..3..4..1....2..0..3..3....2..4..4..3....2..1..3..4
%e A267753 ..3..3..4..1....3..3..4..2....2..0..4..4....3..0..0..4....2..1..3..0
%Y A267753 Cf. A267751.
%K A267753 nonn
%O A267753 1,2
%A A267753 _R. H. Hardin_, Jan 20 2016