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.

A260841 T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010101.

This page as a plain text file.
%I A260841 #6 Jun 02 2025 12:12:12
%S A260841 48,82,82,188,131,188,364,288,288,364,644,496,700,496,644,1320,796,
%T A260841 1224,1224,796,1320,2584,1645,1560,2235,1560,1645,2584,4842,2976,3470,
%U A260841 2590,2590,3470,2976,4842,9412,4890,6908,6232,3828,6232,6908,4890,9412,18210
%N A260841 T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010101.
%C A260841 Table starts
%C A260841 ....48....82...188...364....644...1320...2584...4842....9412...18210...35192
%C A260841 ....82...131...288...496....796...1645...2976...4890....9332...17659...30090
%C A260841 ...188...288...700..1224...1560...3470...6908..10070...18716...39478...64940
%C A260841 ...364...496..1224..2235...2590...6232..13170..17731...34192...77780..123488
%C A260841 ...644...796..1560..2590...3828...8646..16000..24508...49816..103124..168848
%C A260841 ..1320..1645..3470..6232...8646..19718..37882..58489..116930..248515..412314
%C A260841 ..2584..2976..6908.13170..16000..37882..80516.119194..231008..526102..890868
%C A260841 ..4842..4890.10070.17731..24508..58489.119194.181176..369672..835045.1415774
%C A260841 ..9412..9332.18716.34192..49816.116930.231008.369672..766388.1697970.2896836
%C A260841 .18210.17659.39478.77780.103124.248515.526102.835045.1697970.3885356.6805170
%H A260841 R. H. Hardin, <a href="/A260841/b260841.txt">Table of n, a(n) for n = 1..612</a>
%F A260841 Empirical for column k:
%F A260841 k=1: [linear recurrence of order 14] for n>15
%F A260841 k=2: [order 18] for n>19
%F A260841 k=3: [order 22] for n>24
%F A260841 k=4: [order 33] for n>34
%F A260841 k=5: [order 59] for n>63
%F A260841 k=6: [order 92] for n>96
%e A260841 Some solutions for n=4 k=4
%e A260841 ..1..1..0..0..0..0....1..0..0..0..0..0....0..0..0..0..0..0....0..0..1..1..0..1
%e A260841 ..0..0..0..0..0..0....0..1..0..0..1..1....0..0..0..0..0..0....0..0..0..0..0..0
%e A260841 ..0..0..0..0..1..0....0..0..0..0..0..0....0..0..1..0..0..1....0..0..0..0..0..1
%e A260841 ..1..1..0..0..1..0....0..0..0..0..0..0....0..0..1..0..0..1....0..1..1..0..0..0
%e A260841 ..0..0..0..0..0..0....0..1..0..0..1..0....0..0..0..0..0..0....0..0..0..0..0..0
%e A260841 ..0..0..0..0..0..0....1..1..0..0..1..0....0..0..0..0..0..0....0..0..0..0..0..1
%K A260841 nonn,tabl
%O A260841 1,1
%A A260841 _R. H. Hardin_, Aug 01 2015