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.

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

This page as a plain text file.
%I A209735 #7 Jul 22 2025 21:56:09
%S A209735 693752,62007896,6111765608,660346502176,72515584004736,
%T A209735 8142073013529816,914481225452329872,103429210168484832664,
%U A209735 11680327691835359996376,1322584722099506691068936,149590064327411189639443688
%N A209735 1/4 the number of (n+1)X8 0..3 arrays with every 2X2 subblock having distinct edge sums.
%C A209735 Column 7 of A209736
%H A209735 R. H. Hardin, <a href="/A209735/b209735.txt">Table of n, a(n) for n = 1..210</a>
%e A209735 Some solutions for n=4
%e A209735 ..2..3..3..1..3..1..1..0....1..0..0..0..0..3..1..2....3..3..3..0..1..1..1..1
%e A209735 ..2..0..2..1..2..0..3..2....1..3..1..3..1..3..0..2....0..1..2..2..2..3..0..3
%e A209735 ..2..1..2..0..2..1..3..0....1..0..0..2..0..2..0..1....2..3..3..0..1..3..2..2
%e A209735 ..2..0..2..3..2..0..3..2....1..3..1..3..0..3..3..3....0..0..2..0..2..3..1..0
%e A209735 ..1..0..1..1..1..0..1..0....2..3..2..3..1..1..0..1....3..1..2..1..2..0..1..3
%K A209735 nonn
%O A209735 1,1
%A A209735 _R. H. Hardin_ Mar 12 2012