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.

A209730 1/4 the number of (n+1)X3 0..3 arrays with every 2X2 subblock having distinct edge sums.

This page as a plain text file.
%I A209730 #7 Jul 22 2025 21:55:34
%S A209730 124,1096,9712,86744,775096,6933120,62007896,554698328,4961776976,
%T A209730 44385441816,397039390488,3551673425792,31770878566904,
%U A209730 284202098661272,2542285677573168,22741649976952728,203432011675276088
%N A209730 1/4 the number of (n+1)X3 0..3 arrays with every 2X2 subblock having distinct edge sums.
%C A209730 Column 2 of A209736
%H A209730 R. H. Hardin, <a href="/A209730/b209730.txt">Table of n, a(n) for n = 1..210</a>
%F A209730 Empirical: a(n) = 11*a(n-1) +13*a(n-2) -364*a(n-3) +519*a(n-4) +2741*a(n-5) -6099*a(n-6) -4620*a(n-7) +15632*a(n-8) -1696*a(n-9) -8896*a(n-10) +3328*a(n-11)
%e A209730 Some solutions for n=4
%e A209730 ..2..0..2....1..1..3....3..1..3....2..1..3....1..0..0....2..0..0....1..1..2
%e A209730 ..3..3..2....3..0..0....3..0..2....2..0..2....1..3..1....2..1..2....2..3..3
%e A209730 ..1..0..2....1..1..2....1..1..3....2..3..2....2..3..0....3..1..3....0..0..1
%e A209730 ..3..3..2....2..3..3....3..2..3....2..0..2....1..3..1....0..1..0....1..2..2
%e A209730 ..0..1..1....0..0..1....1..1..3....1..0..1....0..2..1....2..3..2....3..3..0
%K A209730 nonn
%O A209730 1,1
%A A209730 _R. H. Hardin_ Mar 12 2012