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.

A251369 Number of (n+1)X(4+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 A251369 #6 Jun 02 2025 10:23:40
%S A251369 53769,12002283,2676962017,597108952883,133187012365193,
%T A251369 29707797738391051,6626420822196876929,1478044705717848217587,
%U A251369 329682676296148787924297,73536792652326563411377515
%N A251369 Number of (n+1)X(4+1) 0..2 arrays with every 2X2 subblock summing to 1 2 3 4 5 6 or 7.
%C A251369 Column 4 of A251373
%H A251369 R. H. Hardin, <a href="/A251369/b251369.txt">Table of n, a(n) for n = 1..210</a>
%F A251369 Empirical: a(n) = 200*a(n-1) +5284*a(n-2) -29042*a(n-3) -605899*a(n-4) +5424778*a(n-5) -14965624*a(n-6) +12176608*a(n-7) +6786256*a(n-8) -7898208*a(n-9) -2471040*a(n-10)
%e A251369 Some solutions for n=1
%e A251369 ..0..2..2..0..1....1..0..2..1..1....1..2..2..0..1....2..2..1..1..0
%e A251369 ..1..1..0..2..1....1..2..0..2..1....2..1..2..0..2....0..2..2..0..0
%K A251369 nonn
%O A251369 1,1
%A A251369 _R. H. Hardin_, Dec 01 2014