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.

A265866 Number of 5Xn arrays containing n copies of 0..5-1 with no element plus any vertical neighbor equal to 5-1.

This page as a plain text file.
%I A265866 #6 Aug 12 2016 06:53:59
%S A265866 48,19080,11544576,8616332520,7213744082208,6506213147078784,
%T A265866 6182493701434699200,6106331818705805071848,6213307943028280874144640,
%U A265866 6473333266657725653848974240,6875099003504356815513699218880
%N A265866 Number of 5Xn arrays containing n copies of 0..5-1 with no element plus any vertical neighbor equal to 5-1.
%C A265866 Row 5 of A265863.
%H A265866 R. H. Hardin, <a href="/A265866/b265866.txt">Table of n, a(n) for n = 1..15</a>
%e A265866 Some solutions for n=2
%e A265866 ..2..0....1..4....2..3....3..1....2..3....0..4....3..0....2..4....0..2....0..1
%e A265866 ..4..1....0..4....1..4....2..2....0..2....0..2....4..2....0..2....1..4....2..4
%e A265866 ..3..0....2..1....0..4....4..0....1..0....1..1....3..4....0..1....0..3....1..3
%e A265866 ..3..2....3..0....1..3....1..0....1..3....4..2....0..1....3..1....3..2....2..0
%e A265866 ..4..1....3..2....0..2....4..3....4..4....3..3....1..2....3..4....4..1....4..3
%Y A265866 Cf. A265863.
%K A265866 nonn
%O A265866 1,1
%A A265866 _R. H. Hardin_, Dec 17 2015