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.

A204073 Number of (n+1)X6 0..2 arrays with every 2X2 subblock having equal diagonal elements or equal antidiagonal elements, and new values 0..2 introduced in row major order.

This page as a plain text file.
%I A204073 #7 Jul 22 2025 17:45:12
%S A204073 4688,221726,11081828,563880962,28864215128,1480470688070,
%T A204073 75985220860460,3900809853901802,200268432775804640,
%U A204073 10282077911857180910,527901424170345081716,27103536327800063656274,1391552121866875493481704
%N A204073 Number of (n+1)X6 0..2 arrays with every 2X2 subblock having equal diagonal elements or equal antidiagonal elements, and new values 0..2 introduced in row major order.
%C A204073 Column 5 of A204076
%H A204073 R. H. Hardin, <a href="/A204073/b204073.txt">Table of n, a(n) for n = 1..210</a>
%F A204073 Empirical: a(n) = 78*a(n-1) -1521*a(n-2) +7304*a(n-3) +32884*a(n-4) -338760*a(n-5) +639312*a(n-6) +947424*a(n-7) -3942080*a(n-8) +2598528*a(n-9) +1739776*a(n-10) -1832448*a(n-11) -14336*a(n-12) +163840*a(n-13)
%e A204073 Some solutions for n=4
%e A204073 ..0..0..0..1..2..1....0..0..1..1..0..1....0..1..1..2..0..1....0..0..1..0..0..0
%e A204073 ..2..0..0..0..1..2....1..0..0..1..1..0....2..0..1..1..2..0....2..0..0..2..0..0
%e A204073 ..2..2..0..1..0..1....0..1..0..0..1..1....2..2..0..1..1..2....2..2..0..0..2..0
%e A204073 ..1..2..2..0..1..2....1..0..2..0..0..1....2..1..2..0..1..1....1..2..2..0..0..0
%e A204073 ..2..2..1..2..0..1....2..1..0..1..0..0....0..2..2..2..0..1....1..1..2..2..0..2
%K A204073 nonn
%O A204073 1,1
%A A204073 _R. H. Hardin_ Jan 10 2012