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.

A185563 1/4 the number of n X 5 0..3 arrays with no element equal both to the element above and to the element to its left.

This page as a plain text file.
%I A185563 #8 May 07 2022 22:02:03
%S A185563 256,202500,159749820,126017211780,99407416968000,78416544382742160,
%T A185563 61858104930689319360,48796145962555619907720,
%U A185563 38492350573406180494467240,30364304873646611423433030660,23952577505016018447231455650500
%N A185563 1/4 the number of n X 5 0..3 arrays with no element equal both to the element above and to the element to its left.
%C A185563 Column 5 of A185567.
%H A185563 R. H. Hardin, <a href="/A185563/b185563.txt">Table of n, a(n) for n = 1..169</a>
%F A185563 Empirical: a(n) = 829*a(n-1)-32339*a(n-2)+525706*a(n-3)-4547088*a(n-4)+22231638*a(n-5)-58780485*a(n-6)+68179725*a(n-7)-10661625*a(n-8).
%e A185563 Some solutions for 3 X 5 with a(1,1)=0.
%e A185563 ..0..0..0..2..3....0..0..0..3..0....0..0..2..2..1....0..0..0..0..2
%e A185563 ..0..2..2..0..0....0..2..0..0..1....0..2..0..1..2....0..2..2..0..1
%e A185563 ..0..0..3..2..0....0..0..1..3..1....0..0..2..1..2....0..2..3..3..1
%Y A185563 Cf. A185567.
%K A185563 nonn
%O A185563 1,1
%A A185563 _R. H. Hardin_, Jan 31 2011