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.

A251365 Number of (n+1)X(n+1) 0..2 arrays with every 2X2 subblock summing to 1 2 3 4 5 6 or 7.

This page as a plain text file.
%I A251365 #7 Jun 02 2025 10:23:34
%S A251365 79,17969,35257505,597108952883,87274898497023663,
%T A251365 110094177769643072247073,1198610045118318903896947691841,
%U A251365 112623783277770500761933316031229772803
%N A251365 Number of (n+1)X(n+1) 0..2 arrays with every 2X2 subblock summing to 1 2 3 4 5 6 or 7.
%C A251365 Diagonal of A251373
%H A251365 R. H. Hardin, <a href="/A251365/b251365.txt">Table of n, a(n) for n = 1..12</a>
%e A251365 Some solutions for n=2
%e A251365 ..2..0..0....1..1..0....0..0..1....0..1..1....0..1..0....1..2..1....2..0..1
%e A251365 ..0..1..2....2..0..2....0..2..2....2..1..1....0..1..0....2..1..1....2..2..1
%e A251365 ..0..0..1....1..2..1....1..1..2....2..2..0....2..1..1....1..1..2....1..2..2
%K A251365 nonn
%O A251365 1,1
%A A251365 _R. H. Hardin_, Dec 01 2014