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.

A233178 Number of 5Xn 0..5 arrays with no element x(i,j) adjacent to itself or value 5-x(i,j) horizontally, diagonally or antidiagonally, top left element zero, and 1 appearing before 2 3 and 4, and 2 appearing before 3 in row major order (unlabelled 6-colorings with no clashing color pairs).

This page as a plain text file.
%I A233178 #6 Jun 02 2025 08:52:01
%S A233178 236,10496,3497984,808583168,221463445504,56275748519936,
%T A233178 14822434649669632,3838772637371203584,1002338782428226650112,
%U A233178 260695613898360688214016,67932875090988311936761856
%N A233178 Number of 5Xn 0..5 arrays with no element x(i,j) adjacent to itself or value 5-x(i,j) horizontally, diagonally or antidiagonally, top left element zero, and 1 appearing before 2 3 and 4, and 2 appearing before 3 in row major order (unlabelled 6-colorings with no clashing color pairs).
%C A233178 Row 5 of A233174
%H A233178 R. H. Hardin, <a href="/A233178/b233178.txt">Table of n, a(n) for n = 1..210</a>
%F A233178 Empirical: a(n) = 192*a(n-1) +31744*a(n-2) -3178496*a(n-3) -170917888*a(n-4) +13992198144*a(n-5) +99857989632*a(n-6) -17660905521152*a(n-7) +211106232532992*a(n-8) +2533274790395904*a(n-9) -40532396646334464*a(n-10) for n>11
%e A233178 Some solutions for n=2
%e A233178 ..0..1....0..1....0..1....0..1....0..1....0..1....0..1....0..1....0..1....0..1
%e A233178 ..2..1....2..4....2..1....5..1....5..1....5..4....2..1....0..1....0..1....5..2
%e A233178 ..3..5....2..4....0..4....2..4....0..2....0..4....3..0....0..2....5..4....4..3
%e A233178 ..3..4....2..4....2..1....2..5....5..4....5..2....1..0....4..2....5..1....4..2
%e A233178 ..5..4....3..0....3..1....3..1....2..4....1..2....2..0....1..0....5..1....1..3
%K A233178 nonn
%O A233178 1,1
%A A233178 _R. H. Hardin_, Dec 05 2013