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.

A259247 Number of (n+1)X(5+1) 0..1 arrays with each 2X2 subblock having clockwise pattern 0000 0011 or 0111.

This page as a plain text file.
%I A259247 #6 Jun 02 2025 11:49:41
%S A259247 255,1733,10720,71313,451481,2964676,18970267,123694345,795726064,
%T A259247 5169185873,33344636925,216190905756,1396553927379,9045384191389,
%U A259247 58474650871712,378535391931953,2448013308032361,15842822807262836
%N A259247 Number of (n+1)X(5+1) 0..1 arrays with each 2X2 subblock having clockwise pattern 0000 0011 or 0111.
%C A259247 Column 5 of A259250
%H A259247 R. H. Hardin, <a href="/A259247/b259247.txt">Table of n, a(n) for n = 1..210</a>
%F A259247 Empirical: a(n) = 6*a(n-1) +49*a(n-2) -268*a(n-3) -920*a(n-4) +4050*a(n-5) +9218*a(n-6) -25662*a(n-7) -49822*a(n-8) +62672*a(n-9) +120020*a(n-10) -35270*a(n-11) -81969*a(n-12) +4820*a(n-13) +15497*a(n-14) -596*a(n-15) -536*a(n-16) +24*a(n-17)
%e A259247 Some solutions for n=4
%e A259247 ..0..1..0..0..0..1....1..1..1..1..1..1....1..1..1..0..0..0....1..0..0..0..1..0
%e A259247 ..1..1..1..1..1..1....0..1..0..0..1..0....1..0..1..1..1..1....1..0..0..0..1..1
%e A259247 ..0..0..0..0..1..0....0..1..0..0..1..0....1..0..1..0..0..0....1..1..1..1..1..0
%e A259247 ..1..1..1..1..1..1....1..1..1..1..1..1....1..1..1..1..1..1....0..1..0..0..1..0
%e A259247 ..1..0..1..0..0..0....0..0..0..1..0..1....0..0..0..1..0..0....0..1..1..1..1..1
%Y A259247 Cf. A259250
%K A259247 nonn
%O A259247 1,1
%A A259247 _R. H. Hardin_, Jun 22 2015