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.

A260837 Number of (n+2)X(4+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010101.

This page as a plain text file.
%I A260837 #6 Jun 02 2025 12:11:42
%S A260837 364,496,1224,2235,2590,6232,13170,17731,34192,77780,123488,206695,
%T A260837 457440,825256,1336836,2725379,5298108,8851516,16674798,33192375,
%U A260837 58277638,104857040,206110260,377809047,671142648,1283474236,2413960656
%N A260837 Number of (n+2)X(4+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010101.
%C A260837 Column 4 of A260841
%H A260837 R. H. Hardin, <a href="/A260837/b260837.txt">Table of n, a(n) for n = 1..210</a>
%F A260837 Empirical: a(n) = a(n-1) +a(n-2) +6*a(n-3) -a(n-4) -12*a(n-5) -15*a(n-6) +2*a(n-7) +18*a(n-8) +28*a(n-9) -3*a(n-10) -28*a(n-11) -a(n-12) +9*a(n-13) +12*a(n-14) +10*a(n-15) -19*a(n-16) -36*a(n-17) +4*a(n-18) +10*a(n-19) -4*a(n-20) +23*a(n-21) +a(n-22) -20*a(n-23) +9*a(n-24) +10*a(n-25) -4*a(n-26) +6*a(n-27) +8*a(n-28) -14*a(n-29) +2*a(n-31) -5*a(n-32) +3*a(n-33) for n>34
%e A260837 Some solutions for n=4
%e A260837 ..0..1..0..0..0..0....1..0..0..0..0..1....1..1..0..0..0..1....1..1..0..0..0..1
%e A260837 ..0..0..0..0..1..1....0..1..0..0..1..1....0..1..0..0..1..0....0..1..0..0..1..0
%e A260837 ..0..0..0..0..0..0....0..0..0..0..0..0....0..0..0..0..0..0....0..0..0..0..0..0
%e A260837 ..1..1..0..0..0..0....0..0..0..0..0..0....0..0..0..0..0..0....0..0..0..0..0..0
%e A260837 ..0..0..0..0..1..1....0..1..0..0..1..1....1..1..0..0..1..0....1..1..0..0..1..0
%e A260837 ..0..0..0..0..0..0....0..1..0..0..0..1....1..0..0..0..0..1....1..0..0..0..1..0
%Y A260837 Cf. A260841
%K A260837 nonn
%O A260837 1,1
%A A260837 _R. H. Hardin_, Aug 01 2015