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.

A233110 Number of nX5 0..5 arrays with no element x(i,j) adjacent to value 5-x(i,j) horizontally or vertically, top left element zero, and 1 appearing before 2 3 and 4, and 2 appearing before 3 in row major order.

This page as a plain text file.
%I A233110 #6 Jul 23 2025 07:53:22
%S A233110 99,123352,189286871,294285758398,457873555330159,712427482567592092,
%T A233110 1108502928092713640626,1724777533707727108574193,
%U A233110 2683671364004795423834363994,4175664311828036646078204783047
%N A233110 Number of nX5 0..5 arrays with no element x(i,j) adjacent to value 5-x(i,j) horizontally or vertically, top left element zero, and 1 appearing before 2 3 and 4, and 2 appearing before 3 in row major order.
%C A233110 Column 5 of A233113
%H A233110 R. H. Hardin, <a href="/A233110/b233110.txt">Table of n, a(n) for n = 1..210</a>
%F A233110 Empirical: a(n) = 1903*a(n-1) -587832*a(n-2) +77760886*a(n-3) -5287016185*a(n-4) +188909127665*a(n-5) -3121291574501*a(n-6) +5961157912045*a(n-7) +488488284983722*a(n-8) -6216213294870140*a(n-9) +30096051456844829*a(n-10) -50425593642643659*a(n-11) -57028414169574032*a(n-12) +289749791197635300*a(n-13) -320983517286000000*a(n-14) +114316383888000000*a(n-15)
%e A233110 Some solutions for n=2
%e A233110 ..0..0..1..5..2....0..1..5..4..0....0..1..1..1..2....0..1..0..1..5
%e A233110 ..0..3..5..5..2....0..0..2..0..1....1..5..5..2..5....2..1..0..0..3
%K A233110 nonn
%O A233110 1,1
%A A233110 _R. H. Hardin_, Dec 04 2013