|
%I
%S 1,1,2,2,11,5,11,122,131,15,34,1814,6282,2150,51,131,26311,409775,
%T 443510,32491,187,438,399849,19707855,95867967,23794078,533186,715,
%U 2150,6013669,1340197778,20978414941,22794825314,1698174722,8362152,2795,7676
%N T(n,k)=Number of nXk 0..3 arrays with no more than floor(nXk/2) elements equal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..3 order
%C Table starts
%C .....1..........1...............2...................11......................34
%C .....2.........11.............122.................1814...................26311
%C .....5........131............6282...............409775................19707855
%C ....15.......2150..........443510.............95867967.............20978414941
%C ....51......32491........23794078..........22794825314..........16473931317022
%C ...187.....533186......1698174722........5472896849943.......17791003053622809
%C ...715....8362152.....93656293632.....1322676376672081....14337592109053271558
%C ..2795..135650378...6637413406814...321195816580955511.15577784123509878927189
%C .11051.2155759835.372075279639542.78284744747263499257
%H R. H. Hardin, <a href="/A222878/b222878.txt">Table of n, a(n) for n = 1..82</a>
%e Some solutions for n=3 k=4
%e ..0..0..0..1....0..0..1..0....0..0..1..2....0..1..0..1....0..1..0..2
%e ..2..3..1..2....0..2..2..3....1..3..1..0....0..2..2..2....1..0..1..3
%e ..0..2..3..0....0..3..2..1....1..2..0..2....1..0..0..0....2..0..2..1
%Y Column 1 is A007581(n-1)
%Y Row 1 is A222650
%K nonn,tabl
%O 1,3
%A _R. H. Hardin_ Mar 08 2013
| 