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.

A209498 Number of nX3 0..4 arrays with every 2X2 subblock containing exactly one value repeat, and new values 0..4 introduced in row major order.

This page as a plain text file.
%I A209498 #9 Jul 22 2025 21:45:54
%S A209498 5,57,1938,78135,3268686,137627625,5801378991,244591579065,
%T A209498 10312560758853,434804544586449,18332515897436133,772947757887140085,
%U A209498 32589539696259731973,1374061949636494558605,57934118148061257233025
%N A209498 Number of nX3 0..4 arrays with every 2X2 subblock containing exactly one value repeat, and new values 0..4 introduced in row major order.
%C A209498 Column 3 of A209503
%H A209498 R. H. Hardin, <a href="/A209498/b209498.txt">Table of n, a(n) for n = 1..210</a>
%F A209498 Empirical: a(n) = 52*a(n-1) -388*a(n-2) -1564*a(n-3) +19075*a(n-4) -29776*a(n-5) -22290*a(n-6) +50544*a(n-7) -5832*a(n-8) for n>9
%e A209498 Some.solutions.for.n=4
%e A209498 ..0..0..1....0..1..2....0..0..0....0..1..0....0..1..0....0..1..2....0..1..1
%e A209498 ..2..3..3....2..1..3....1..2..3....2..1..2....2..2..2....0..3..3....0..2..0
%e A209498 ..4..2..1....1..4..1....0..1..2....3..1..0....3..0..1....0..4..0....1..1..2
%e A209498 ..2..0..1....3..1..2....1..3..3....3..2..1....2..2..0....2..4..1....2..0..2
%K A209498 nonn
%O A209498 1,1
%A A209498 _R. H. Hardin_ Mar 09 2012