

A196950


T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 4,1,0,2,3 for x=0,1,2,3,4


7



1, 2, 2, 4, 11, 4, 6, 38, 38, 6, 12, 136, 210, 136, 12, 22, 496, 1416, 1416, 496, 22, 40, 1792, 9199, 18060, 9199, 1792, 40, 74, 6440, 60206, 220433, 220433, 60206, 6440, 74, 136, 23306, 393585, 2711711, 5039158, 2711711, 393585, 23306, 136, 250, 84180
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

Every 0 is next to 0 4's, every 1 is next to 1 1's, every 2 is next to 2 0's, every 3 is next to 3 2's, every 4 is next to 4 3's
Table starts
...1......2.........4...........6.............12................22
...2.....11........38.........136............496..............1792
...4.....38.......210........1416...........9199.............60206
...6....136......1416.......18060.........220433...........2711711
..12....496......9199......220433........5039158.........115982718
..22...1792.....60206.....2711711......115982718........4998342821
..40...6440....393585....33344883.....2668162530......215125975535
..74..23306...2575161...410312728....61397041229.....9264434681345
.136..84180..16853437..5047886243..1412800280934...398999272140802
.250.303664.110272832.62090427845.32510004942226.17183027304906341


LINKS

R. H. Hardin, Table of n, a(n) for n = 1..144


EXAMPLE

Some solutions for n=6 k=4
..0..0..0..0....0..0..0..2....0..0..0..0....0..0..0..0....0..0..0..0
..0..0..0..0....0..0..0..0....0..0..0..0....0..0..1..0....0..0..0..2
..2..0..0..0....1..2..1..1....0..1..1..0....1..0..1..0....2..0..0..1
..2..0..1..2....1..0..0..2....1..0..0..0....1..2..0..0....1..2..2..1
..0..0..1..0....0..0..0..0....1..2..1..0....0..1..0..0....1..0..0..2
..1..1..0..0....0..2..2..0....0..0..1..0....0..1..2..0....0..0..0..0


CROSSREFS

Column 1 is A196700
Column 2 is A196850
Sequence in context: A321204 A196856 A196707 * A295847 A296739 A218823
Adjacent sequences: A196947 A196948 A196949 * A196951 A196952 A196953


KEYWORD

nonn,tabl


AUTHOR

R. H. Hardin Oct 08 2011


STATUS

approved



