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.

A233253 Number of n X 5 0..5 arrays with no element x(i,j) adjacent to itself or value 5-x(i,j) horizontally 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 A233253 #7 Oct 11 2018 04:09:52
%S A233253 36,13952,6049792,2647261184,1159192379392,507618560835584,
%T A233253 222290692443996160,97343107609552486400,42627429627049642295296,
%U A233253 18666938062087506825838592,8174421486934238668125110272
%N A233253 Number of n X 5 0..5 arrays with no element x(i,j) adjacent to itself or value 5-x(i,j) horizontally 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).
%H A233253 R. H. Hardin, <a href="/A233253/b233253.txt">Table of n, a(n) for n = 1..210</a>
%F A233253 Empirical: a(n) = 512*a(n-1) - 33792*a(n-2) + 589824*a(n-3).
%F A233253 Empirical g.f.: 4*x*(9 - 1120*x + 30720*x^2) / ((1 - 32*x)*(1 - 480*x + 18432*x^2)). - _Colin Barker_, Oct 11 2018
%e A233253 Some solutions for n=2:
%e A233253 ..0..1..2..4..3....0..1..2..5..3....0..1..2..1..0....0..1..2..4..2
%e A233253 ..5..4..3..5..2....2..1..2..0..1....2..1..0..3..0....2..4..0..1..5
%Y A233253 Column 5 of A233256.
%K A233253 nonn
%O A233253 1,1
%A A233253 _R. H. Hardin_, Dec 06 2013