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.

A302381 T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

This page as a plain text file.
%I A302381 #4 Apr 06 2018 12:42:28
%S A302381 0,1,0,1,3,0,2,15,11,0,3,46,76,34,0,5,161,430,475,111,0,8,601,2886,
%T A302381 4640,2771,361,0,13,2208,19215,56541,48980,16451,1172,0,21,8053,
%U A302381 127535,688999,1089035,514655,97160,3809,0,34,29415,847604,8334338,24209608,20993054
%N A302381 T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.
%C A302381 Table starts
%C A302381 .0.....1.......1.........2............3..............5................8
%C A302381 .0.....3......15........46..........161............601.............2208
%C A302381 .0....11......76.......430.........2886..........19215...........127535
%C A302381 .0....34.....475......4640........56541.........688999..........8334338
%C A302381 .0...111....2771.....48980......1089035.......24209608........535192095
%C A302381 .0...361...16451....514655.....20993054......849467774......34271733937
%C A302381 .0..1172...97160...5421003....404225195....29810775827....2195619257236
%C A302381 .0..3809..574671..57068484...7787623959..1046322460741..140685735128595
%C A302381 .0.12377.3397622.600825641.150008013842.36721875744312.9013655138528774
%H A302381 R. H. Hardin, <a href="/A302381/b302381.txt">Table of n, a(n) for n = 1..180</a>
%F A302381 Empirical for column k:
%F A302381 k=1: a(n) = a(n-1)
%F A302381 k=2: a(n) = 3*a(n-1) +a(n-2) -2*a(n-4)
%F A302381 k=3: [order 11]
%F A302381 k=4: [order 26]
%F A302381 k=5: [order 84] for n>86
%F A302381 Empirical for row n:
%F A302381 n=1: a(n) = a(n-1) +a(n-2)
%F A302381 n=2: a(n) = 3*a(n-1) +a(n-2) +4*a(n-3) +4*a(n-4) for n>5
%F A302381 n=3: [order 14] for n>15
%F A302381 n=4: [order 42] for n>43
%e A302381 Some solutions for n=5 k=4
%e A302381 ..0..0..0..1. .0..1..0..0. .0..1..1..0. .0..0..0..0. .0..1..1..1
%e A302381 ..0..1..1..0. .0..0..1..0. .0..0..0..1. .0..0..1..1. .1..0..0..0
%e A302381 ..0..1..1..1. .0..0..1..1. .0..1..1..1. .0..0..1..0. .0..1..0..0
%e A302381 ..1..0..1..0. .0..0..1..1. .0..0..0..0. .0..1..0..0. .0..0..1..1
%e A302381 ..1..1..0..0. .0..1..1..1. .0..0..1..1. .1..1..0..0. .1..1..0..0
%Y A302381 Column 2 is A180762.
%Y A302381 Row 1 is A000045(n-1).
%Y A302381 Row 2 is A232077(n-1).
%K A302381 nonn,tabl
%O A302381 1,5
%A A302381 _R. H. Hardin_, Apr 06 2018